The spectral radius of subgraphs of regular graphs
classification
🧮 math.CO
keywords
regularbounddiametergivegivengraphsorderradius
read the original abstract
We give a bound on the spectral radius of subgraphs of regular graphs with given order and diameter. We give a lower bound on the smallest eigenvalue of a nonbipartite regular graph of given order and diameter.
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.