TOPICS
Search

Hall-Janko Near Octagon

DOWNLOAD Mathematica NotebookDownload Wolfram Notebook

The Hall-Janko near octagon, also known as the Cohen-Tits near octagon, is a weakly regular graph on 315 vertices with parameters (n,k,lambda,mu)=(315,(10),(1),(0,1)). It is distance-regular with intersection array {10,8,8,2;1,1,4,5} and also distance-transitive.

It has graph spectrum (-5)^(28)(-2)^(160)3^(90)5^(36)10^1 and so is an integral graph. It has graph automorphism group order Aut(G)=1209600.

It is a Hamiltonian graph.

The Hall-Janko near octagon is implemented in the Wolfram Language as GraphData["HallJankoNearOctagon"].

See also

Distance-Regular Graph, Distance-Transitive Graph

Explore with Wolfram|Alpha

References

Brouwer, A. E. "The Cohen-Tits Near Octagon on 315 Points." http://www.win.tue.nl/~aeb/drg/graphs/HJ315.html.Brouwer, A. E.; Cohen, A. M.; and Neumaier, A. Distance-Regular Graphs. New York: Springer-Verlag, pp. 408-410, 1989.Cohen, A. M. "Geometries Originating from Certain Distance-Regular Graphs." In Proc. Finite Geometries and Designs. Cambridge, England: Cambridge University Press, pp. 81-87, 1981.Cohen, A. M. and Tits, J. "On Generalized Hexagons and a Near Octagon Whose Lines Have Three Points." Europ. J. Combin. 6, 13-27, 1985.DistanceRegular.org. "Hall-Janko Near Octagon from J_2.2 = Cohen-Tits Near Octagon." http://www.distanceregular.org/graphs/halljanko315.html.

Cite this as:

Weisstein, Eric W. "Hall-Janko Near Octagon." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/Hall-JankoNearOctagon.html

Subject classifications