Tight estimates for eigenvalues of regular graphs
type: Item
instance of: scholarly article
title: Tight estimates for eigenvalues of regular graphs
zbMATH Open document ID: 1053.05082
author: Noga Alon
published in: The Electronic Journal of Combinatorics
publication date: 2004-10-13T00:00:00Z
full work available at URL: https://eudml.org/doc/124017
full work available at URL: v11i1n9.html
review text: Summary: It is shown that if a \(d\)-regular graph contains \(s\) vertices so that the distance between any pair is at least \(4k\), then its adjacency matrix has at least \(s\) eigenvalues which are at least \(2\sqrt{d-1}\cos({\pi\over 2k})\). A similar result has been proved by Friedman using more sophisticated tools.
Mathematics Subject Classification ID: 05C50
zbMATH DE Number: 2107514
zbMATH Keywords: adjacency matrix
zbMATH Keywords: eigenvalues
MaRDI profile type: Publication
Recommended article: Bounds on graph eigenvalues
Recommended article: Bounds of eigenvalues of graphs
Recommended article: Eigenvalue estimates on a connected finite graph
Recommended article: Eigenvalues and edge-connectivity of regular graphs
Recommended article: Bounds for eigenvalues of a graph
Recommended article: On the extreme eigenvalues of regular graphs.
Recommended article: On the limit points of the smallest eigenvalues of regular graphs
Recommended article: An eigenvalue bound for the Laplacian of a graph
Recommended article: Bounds for Laplacian graph eigenvalues
Recommended article: Eigenvalues and expansion of regular graphs
description: scientific article; zbMATH DE number 2107514