1986 | OriginalPaper | Chapter
Automorphism Groups
Authors : Professor Ivan Gutman, Professor Oskar E. Polansky
Published in: Mathematical Concepts in Organic Chemistry
Publisher: Springer Berlin Heidelberg
Included in: Professional Book Archive
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
The notion of graph automorphism has already been introduced in Section 4.1. An automorphism may be understood as a bijective (that is one-to-one) mapping of the vertex set V(G) of the graph onto itself which preserves the edge relation ℰ(G) of the graph. Evidently, only those vertices can be mapped onto each other which are equivalent, i.e. they are indistinguishable apart from their labels. A subset of V(G) formed by all mutually equivalent vertices is called an orbit of the graph vertices.