Title of article
Eigenvalues and extremal degrees of graphs
Author/Authors
Vladimir Nikiforov، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2006
Pages
4
From page
735
To page
738
Abstract
Let G be a graph with n vertices, μ1(G) μn(G) be the eigenvalues of its adjacency matrix, and 0=λ1(G) λn(G) be the eigenvalues of its Laplacian. We show that and
Let be an infinite family of graphs. We prove that is quasi-random if and only if for every of order n. This also implies that if (or equivalently ) for every of order n, then is quasi-random.
Keywords
Graph eigenvalues , Laplacian eigenvalues , Minimum degree , Maximum degree , Quasi-random graphs , Conditions for quasi-randomness
Journal title
Linear Algebra and its Applications
Serial Year
2006
Journal title
Linear Algebra and its Applications
Record number
825385
Link To Document