Spectral Radius and Degree Sequence of a Graph
Combinatorics
2012-08-10 v1
Abstract
Let G be a simple connected graph of order n with degree sequence d_1, d_2, ..., d_n in non-increasing order. The spectral radius rho(G) of G is the largest eigenvalue of its adjacency matrix. For each positive integer L at most n, we give a sharp upper bound for rho(G) by a function of d_1, d_2, ..., d_L, which generalizes a series of previous results.
Cite
@article{arxiv.1208.1958,
title = {Spectral Radius and Degree Sequence of a Graph},
author = {Chia-an Liu and Chih-wen Weng},
journal= {arXiv preprint arXiv:1208.1958},
year = {2012}
}