Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Gutman, I., Polansky, O.E. (1986). Automorphism Groups. In: Mathematical Concepts in Organic Chemistry. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-70982-1_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-70982-1_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-70984-5
Online ISBN: 978-3-642-70982-1
eBook Packages: Springer Book Archive