期刊
LINEAR ALGEBRA AND ITS APPLICATIONS
卷 432, 期 9, 页码 2243-2256出版社
ELSEVIER SCIENCE INC
DOI: 10.1016/j.laa.2009.05.023
关键词
Spectral radius; Cycles; Paths
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 right bounds on the spectral radius of graphs without given even cycles. We also raise a number of open problems. (C) 2009 Elsevier Inc. All rights reserved.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据