WLJS LogoWLJS Notebook

VertexTransitiveGraphQ

VertexTransitiveGraphQ[g] yields True if the graph g is a vertex-transitive graph and False otherwise.

A vertex-transitive graph is one where all vertices are equivalent under the graph's automorphism group.

Examples

VertexTransitiveGraphQ[CompleteGraph[5]]
VertexTransitiveGraphQ[CycleGraph[6]]
VertexTransitiveGraphQ[PathGraph[{1, 2, 3}]]

*See the official Wolfram Language Reference for more details.

On this page