A characterization on graphs which achieve the upper bound for the largest Laplacian eigenvalue of graphs. (Q1415294)

From MaRDI portal
Revision as of 12:04, 6 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A characterization on graphs which achieve the upper bound for the largest Laplacian eigenvalue of graphs.
scientific article

    Statements

    A characterization on graphs which achieve the upper bound for the largest Laplacian eigenvalue of graphs. (English)
    0 references
    3 December 2003
    0 references
    Graph
    0 references
    Laplacian matrix
    0 references
    Largest eigenvalue
    0 references
    Upper bound
    0 references
    0 references

    Identifiers