On the Spectrum, the Growth, and the Diameter of a Graph

4Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A lower bound is given for the harmonic mean of the growth in a finite undirected graphΓin terms of the eigenvalues of the Laplacian ofΓ. For a connected graph, this bound is tight if and only if the graph is distance-regular. Bounds on the diameter of a "sphere-regular" graph follow. Finally, a lower bound is given for the growth in an infinite undirected graph of bounded degree in terms of the spectrum of its Laplacian. © 1999 Academic Press.

Cite

CITATION STYLE

APA

Hajaj, N. (1999). On the Spectrum, the Growth, and the Diameter of a Graph. Journal of Combinatorial Theory. Series B, 76(1), 1–21. https://doi.org/10.1006/jctb.1998.1882

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free