The Livingstone graph is a distance-transitive graph on 266 vertices defined in terms of the Janko
group 
.
It has intersection array 
.
The Livingstone graph is implemented in the Wolfram Language as GraphData["LivingstoneGraph"].
Livingstone Graph
See also
Distance-Regular Graph, Distance-Transitive Graph, Janko GroupsExplore with Wolfram|Alpha
References
Brouwer, A. E.; Cohen, A. M.; and Neumaier, A. "The Livingstone Graph for
." §13.5 in Distance
Regular Graphs. New York: Springer-Verlag, pp. 225 and 406-408, 1989.DistanceRegular.org.
"Livingstone Graph." http://www.distanceregular.org/graphs/livingstone.html.Livingstone,
D. "On a Permutation Representation of the Janko Group." J. Algebra 6,
43-55, 1967.Referenced on Wolfram|Alpha
Livingstone GraphCite this as:
Weisstein, Eric W. "Livingstone Graph." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/LivingstoneGraph.html