Constantine, Gregory P

On the extreme complexity of certain nearly regular graphs

2025 · arXiv (Cornell University)

The complexity of a graph is the number of its labeled spanning trees. It is demonstrated that the seven known triangle-free strongly regular graphs, such as the Higman-Sims graph, are graphs of maximal complexity among …