Hoffman-Singleton graph
This article defines a particular undirected graph, i.e., the definition here determines the graph uniquely up to graph isomorphism.
View a complete list of particular undirected graphs
Definition
The Hoffman-Singleton graph can be defined as the unique strongly regular graph of type .
Arithmetic functions
Size measures
| Function | Value | Explanation |
|---|---|---|
| size of vertex set | 50 | |
| size of edge set | 175 |
Numerical invariants associated with vertices
Since the graph is a vertex-transitive graph, any numerical invariant associated to a vertex must be equal on all vertices of the graph. Below are listed some of these invariants:
| Function | Value | Explanation |
|---|---|---|
| degree of a vertex | 7 | |
| eccentricity of a vertex | 2 |