Node-link graph with 50 vertices and 175 edges, the smallest possible 7-regular graph of girth 5
Also known as Hoffman-Singleton graph
21 statements · 14% with external sources · numbers in brackets are citations
5 identifiers linking Hoffman–Singleton graph across the web's reference databases
From Wikipedia, the free encyclopedia · Read full article · Text CC BY-SA 4.0
In the mathematical field of graph theory, the Hoffman–Singleton graph is a 7-regular undirected graph with 50 vertices and 175 edges. It is the unique strongly regular graph with parameters (50,7,0,1). It was constructed by Alan Hoffman and Robert Singleton while trying to classify all Moore graphs, and is the highest-order Moore graph known to exist. Since it is a Moore graph where each vertex has degree 7, and the girth is 5, it is a (7,5)-cage.