3 papers
math.CO2025
An exact closed walks series formula for the complexity of regular graphs and some related bounds
Gregory P Constantine, Gregory Magda
The complexity of a graph is the number of its labeled spanning trees. In this work complexity is studied in settings that admit regular graphs. An exact formula is established lin…
math.CO2025
Higher diameters of Cayley digraphs
G. C. Magda, J. Rubin, S. Streipert +3
Higher diameters of Cayley digraphs are defined and studied.
math.CO2025
On the extreme complexity of certain nearly regular graphs
Gregory P Constantine, Gregory C Magda
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,…