The Moore bound for Spectral Radius
classification
🧮 math.CO
keywords
boundeigenvaluegirthgivegivengraphlargestmoore
read the original abstract
We give an upper bound on the largest eigenvalue of a graph of given order, size, and girth.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.