Home / Get Math Help
32-edge Transitive Graph 11
Image
Alternate names
Basic properties
vertex count | 32 edge count | 80 connected component count | 1
Graph features
antipodal | arc-transitive | biconnected | bridgeless | class 1 | conformally rigid | connected | cyclic | distance-regular | distance-transitive | edge-transitive | fully reconstructible in C^1 | Hamilton-connected | Hamilton-decomposable | Hamiltonian | H-star connected | imperfect | LCF | local | multigraphic | nonempty | noneulerian | nongeometric | nonplanar | not determined by spectrum | not uniquely embeddable | perfect matching | quintic | regular | rigid | simple | square-free | switchable | symmetric | traceable | triangle-free | vertex-transitive | weakly regular
Complement graph
(not a named graph)
Line graph
(not a named graph)