Definitions from Wikipedia (Graph automorphism)

▸ noun:  In the mathematical field of graph theory, an automorphism of a graph is a form of symmetry in which the graph is mapped onto itself while preserving the edge–vertex connectivity.


▸ Words similar to Graph automorphism
▸ Usage examples for Graph automorphism

▸ Idioms related to Graph automorphism
▸ Wikipedia articles (New!)
▸ Words that often appear near Graph automorphism
▸ Rhymes of Graph automorphism

▸ Invented words related to Graph automorphism