Livingstone graph
From Wikipedia, the free encyclopedia
In the mathematical field of graph theory, the Livingstone graph is a distance-transitive graph with 266 vertices and 1463 edges. Its intersection array is {11,10,6,1;1,1,5,11}.[1] It is the largest distance-transitive graph with degree 11.[2]
Quick Facts Vertices, Edges ...
Livingstone graph | |
---|---|
Vertices | 266 |
Edges | 1463 |
Radius | 4 |
Diameter | 4 |
Girth | 5 |
Automorphisms | 175560 (J1) |
Properties | Symmetric Distance-transitive Primitive |
Table of graphs and parameters |
Close