期刊
JOURNAL OF COMBINATORIAL THEORY SERIES B
卷 81, 期 2, 页码 177-183出版社
ACADEMIC PRESS INC ELSEVIER SCIENCE
DOI: 10.1006/jctb.2000.1997
关键词
spectral radius; upper bounds; minor; genus
类别
Let G be a simple connected graph with n vertices and m edges. Let S(G) = S br the minimum degree of vertices of G. Thr spectral radius p(G) of G is the largest eigenvalue of its adjacency matrix. In this paper, we obtain the following sharp upper bound of p(G): [GRAPHICS] Equality holds if and only if G is either a regular graph or a bidegreed graph in which each vertex is of degree either S or n - 1. (C) 2001 Academic Press.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据