Walks and the spectral radius of graphs
โ Scribed by Vladimir Nikiforov
- Publisher
- Elsevier Science
- Year
- 2006
- Tongue
- English
- Weight
- 161 KB
- Volume
- 418
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
Let ฮป 1 be the largest eigenvalue and ฮป n the least eigenvalue of the adjacency matrix of a connected graph G of order n. We prove that if G is irregular with diameter D, maximum degree ฮ, minimum degree ฮด and average degree d, then . The inequality improves previous bounds of various authors and
Let G be a graph of order n and ฮผ(G) be the largest eigenvalue of its adjacency matrix. Let G be the complement of G. Write K n-1 + v for the complete graph on n -1 vertices together with an isolated vertex, and K n-1 + e for the complete graph on n -1 vertices with a pendent edge. We show that:
This paper provides new upper bounds on the spectral radius \ (largest eigenvalue of the adjacency matrix) of graphs embeddable on a given compact surface. Our method is to bound the maximum rowsum in a polynomial of the adjacency matrix, using simple consequences of Euler's formula. Let # denote th
In this paper, we obtain a relation between the spectral radius and the genus of a graph. In particular, we give upper bounds on the spectral radius of graphs with \(n\) vertices and small genus. " " 1995 Academic Press. Ins