On the spectrum, the growth, and the diameter of a graph (Q1305521)

From MaRDI portal
scientific article
Language Label Description Also known as
English
On the spectrum, the growth, and the diameter of a graph
scientific article

    Statements

    On the spectrum, the growth, and the diameter of a graph (English)
    0 references
    0 references
    9 February 2000
    0 references
    A lower bound is given for the harmonic mean of the growth in a finite undirected graph \(\Gamma\) in terms of the eigenvalues of the Laplacian of \(\Gamma\). 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. \(\copyright\) Academic Press.
    0 references
    harmonic mean of the growth
    0 references
    eigenvalues
    0 references
    Laplacian
    0 references
    distance-regular
    0 references
    diameter
    0 references
    spectrum
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references