Home
Random
Nearby
Log in
Settings
Donate
About Wikipedia
Disclaimers
Search
Template
:
Graph families defined by their automorphisms
Template
Talk
Language
Watch
Edit
Graph families defined by their automorphisms
distance-transitive
→
distance-regular
←
strongly regular
↓
symmetric (arc-transitive)
←
t
-transitive,
t
≥ 2
skew-symmetric
↓
(if connected)
vertex- and edge-transitive
→
edge-transitive and regular
→
edge-transitive
↓
↓
↓
vertex-transitive
→
regular
→
(if bipartite)
biregular
↑
Cayley graph
←
zero-symmetric
asymmetric