Definitions from Wikipedia (Symmetric graph)

▸ noun:  In the mathematical field of graph theory, a graph is symmetric (or arc-transitive) if, given any two pairs of adjacent vertices and of , there is an automorphism


▸ Words similar to symmetric graph
▸ Usage examples for symmetric graph

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

▸ Invented words related to symmetric graph