The spectral radius of graphs without paths and cycles of specified length |
| |
Authors: | Vladimir Nikiforov |
| |
Institution: | Department of Mathematical Sciences, University of Memphis, Memphis, TN 38152, United States |
| |
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. |
| |
Keywords: | 05C50 05C35 |
本文献已被 ScienceDirect 等数据库收录! |
|