The spectral radius of graphs without paths and cycles of specified length
Combinatorics
2009-04-01 v1
Abstract
Let G be a graph with n vertices and mu(G) be the largest eigenvalue of the adjacency matrix of G. We study how large mu(G) can be when G does not contain cycles and paths of specified order. In particular, we determine the maximum spectral radius of graphs without paths of given length, and give tight bounds on the spectral radius of graphs without given even cycles. We also raise a number of natural open problems.
Cite
@article{arxiv.0903.5351,
title = {The spectral radius of graphs without paths and cycles of specified length},
author = {Vladimir Nikiforov},
journal= {arXiv preprint arXiv:0903.5351},
year = {2009}
}