Spectral diameter estimates for \(k\)-regular graphs
type: Item
instance of: scholarly article
title: Spectral diameter estimates for \(k\)-regular graphs
zbMATH Open document ID: 0808.05071
published in: Advances in Mathematics
publication date: 1994-01-01T00:00:00Z
review text: An upper bound for the diameter of a regular graph, which depends on the second largest eigenvalue (in modulus) of the adjacency matrix and on the girth, is derived.
reviewed by: Dragoš Cvetković
Mathematics Subject Classification ID: 05C50
Mathematics Subject Classification ID: 05C38
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 638535
zbMATH Keywords: upper bound
zbMATH Keywords: diameter
zbMATH Keywords: regular graph
zbMATH Keywords: eigenvalue
zbMATH Keywords: adjacency matrix
zbMATH Keywords: girth
author: Gregory T. Quenell
MaRDI profile type: Publication
full work available at URL: aima.1994.1052
OpenAlex ID: W2049518778
DOI: 10.1006/AIMA.1994.1052
description: scientific article; zbMATH DE number 638535