The Hall–Janko graph is a well-known graph in the field of graph theory and combinatorial design. It is named after mathematicians Philip Hall and J. M. Janko. The graph has the following characteristics: 1. **Vertices and Edges**: The Hall–Janko graph consists of 100 vertices and 300 edges. 2. **Regular**: It is a strongly regular graph with parameters \((100, 30, 0, 12)\).
Articles by others on the same topic
There are currently no matching articles.