A graph automorphism is a form of symmetry in graph theory in which a graph is mapped onto itself while preserving its edge-vertex connectivity, that is, a permutation of the graph's vertices under which connected pairs of vertices remain connected. The composition of two automorphisms is again an automorphism, and the full collection of a graph's automorphisms forms a group under composition called its automorphism group. By Frucht's theorem, every abstract group can be represented as the automorphism group of some connected graph, linking graph symmetry directly to general group theory. This description is adapted from Wikipedia contributors under CC BY-SA 4.0; changes were made. https://creativecommons.org/licenses/by-sa/4.0/
Facts
Connections
In Branch
Source Graph Automorphism (Wikipedia)
Is Kind Of Object
Entity-backed identity for the object-kind enum value this mathematical object already carries, resolved to a mathematics concept by an explicit value-to-entity map (phase 3 bucket conversion, docs\design_entity_backed_browse_buckets_20260928.md). The object-kind fact itself stays on the object unchanged.
Sources
1. Graph Automorphism (Wikipedia)
- Lead section
In Branch: Graph Theory, Lead sentence
In the mathematical field of graph theory, an automorphism of a graph is a form of symmetry in which the graph is mapped onto itse
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.