Hall-Janko Graph

DOWNLOAD Mathematica 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}. 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.

Wolfram Web Resources

Mathematica »

The #1 tool for creating Demonstrations and anything technical.

Wolfram|Alpha »

Explore anything with the first computational knowledge engine.

Wolfram Demonstrations Project »

Explore thousands of free applications across science, mathematics, engineering, technology, business, art, finance, social sciences, and more.

Computerbasedmath.org »

Join the initiative for modernizing math education.

Online Integral Calculator »

Solve integrals with Wolfram|Alpha.

Step-by-step Solutions »

Walk through homework problems step-by-step from beginning to end. Hints help you try the next step on your own.

Wolfram Problem Generator »

Unlimited random practice problems and answers with built-in Step-by-step solutions. Practice online or make a printable study sheet.

Wolfram Education Portal »

Collection of teaching and learning tools built by Wolfram education experts: dynamic textbook, lesson plans, widgets, interactive Demonstrations, and more.

Wolfram Language »

Knowledge-based programming for everyone.