<script type="text/javascript">
<!--
document.write('<div id="oa_widget"></div>');
document.write('<script type="text/javascript" src="https://www.openaire.eu/index.php?option=com_openaire&view=widget&format=raw&projectId=undefined&type=result"></script>');
-->
</script>

COPY SCRIPT

For further information contact us at helpdesk@openaire.eu

Eigenvalues and the diameter of graphs

descriptionPublicationkeyboard_double_arrow_right Article , Research , Preprint 01 Jul 1995 Netherlands English Publisher:Informa UK LimitedJournal:Linear and Multilinear Algebra, volume 39, pages 33-44 (issn: 0308-1087, eissn: 1563-5139,

Authors: van Dam, E.R.; Haemers, W.H.;

doi: 10.1080/03081089508818378

Eigenvalues and the diameter of graphs

- Summary
- Subjects
- Metrics

Abstract

Using eigenvalue interlacing and Chebyshev polynomials we find upper bounds for the diameter of regular and bipartite biregular graphs in terms of their eigenvalues. This improves results of Chung and Delorme and Sole. The same method gives upper bounds for the number of vertices at a given minimum distance from a given vertex set. These results have some applications to the covering radius of error-correcting codes.

Country

Netherlands

Related Organizations

Tilburg University
Netherlands

Keywords

Graphs;Eigenvalues, Eigenvalues, Graphs; Eigenvalues, Graphs

Impact byBIP!

	citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	22
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Top 10%