Definitions from Wikipedia (Vertex-transitive graph)
▸ noun: In the mathematical field of graph theory, an automorphism is a permutation of the vertices such that edges are mapped to edges and non-edges are mapped to non-edges.
▸ Words similar to vertex-transitive graph
▸ Usage examples for vertex-transitive graph
▸ Idioms related to vertex-transitive graph
▸ Wikipedia articles (New!)
▸ Words that often appear near vertex-transitive graph
▸ Rhymes of vertex-transitive graph
▸ Invented words related to vertex-transitive graph
▸ noun: In the mathematical field of graph theory, an automorphism is a permutation of the vertices such that edges are mapped to edges and non-edges are mapped to non-edges.
▸ Words similar to vertex-transitive graph
▸ Usage examples for vertex-transitive graph
▸ Idioms related to vertex-transitive graph
▸ Wikipedia articles (New!)
▸ Words that often appear near vertex-transitive graph
▸ Rhymes of vertex-transitive graph
▸ Invented words related to vertex-transitive graph