TOPICS
Search

Hall-Janko Graph

DOWNLOAD Mathematica NotebookDownload Wolfram Notebook
Hall-JankoGraph

The Hall-Janko graph, also known as the Hall-Janko-Wales graph, is a strongly regular graph on 100 nodes with parameters (nu,k,lambda,mu)=(100,36,14,12). It is also a distance-regular graph with intersection array {36,21;1,12}, as well as being distance-transitive. It is illustrated above in an embedding due to C. Rocchini.

It is an integral graph with graph spectrum (-4)^(63)6^(36)36^1. The Hall-Janko graph has independence number 10 and chromatic number 10, while the graph complement of the Hall-Janko graph has independence number 4 and chromatic number 25 (Brouwer).

It is implemented in the Wolfram Language as GraphData["HallJankoGraph"].

It is the middle graph in the chain of local graphs known as the Suzuki tower.

See also

Hall-Janko Group, Integral Graph, Strongly Regular Graph, Suzuki Tower

Explore with Wolfram|Alpha

References

Bagchi, B. "A Regular Two-Graph Admitting the Hall-Janko-Wales Group." Combinatorial Mathematics and Applications (Calcutta, 1988). Sankhyā Ser. A 54, 35-45, 1992.Brouwer, A. E. "A Construction of the HJ Graph." Preprint. 1989.Brouwer, A. E. "Hall-Janko Graph." http://www.win.tue.nl/~aeb/drg/graphs/HallJanko.html.DistanceRegular.org. "Hall-Janko Graph." http://www.distanceregular.org/graphs/halljanko.html.Hall, M. Jr. and Wales, D. "The Simple Group of Order 604,800." J. Algebra 9, 417-450, 1968.Jørgensen, L. K. and Klin, M. "Switching of Edges in Strongly Regular Graphs. I. A Family of Partial Difference Sets on 100 Vertices." Electr. J. Combin. 10, No. R17, 2003.

Cite this as:

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

Subject classifications