Walks and the spectral radius of graphs
classification
🧮 math.CO
keywords
numberradiusspectralwalksboundsgeneralizegivegraph
read the original abstract
We give upper and lower bounds on the spectral radius of a graph in terms of the number of walks. We generalize a number of known results.
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.