Journal
JOURNAL OF COMBINATORIAL THEORY SERIES B
Volume 81, Issue 2, Pages 177-183Publisher
ACADEMIC PRESS INC ELSEVIER SCIENCE
DOI: 10.1006/jctb.2000.1997
Keywords
spectral radius; upper bounds; minor; genus
Categories
Ask authors/readers for more resources
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.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available