The spectral radius of graphs without paths and cycles of specified length
Abstract
Let G be a graph with n vertices and μ (G) be the largest eigenvalue of the adjacency matrix of G. We study how large μ (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 open problems. © 2009 Elsevier Inc. All rights reserved.
Publication Title
Linear Algebra and Its Applications
Recommended Citation
Nikiforov, V. (2010). The spectral radius of graphs without paths and cycles of specified length. Linear Algebra and Its Applications, 432 (9), 2243-2256. https://doi.org/10.1016/j.laa.2009.05.023
COinS
