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

From MaRDI portal
Revision as of 06:13, 21 February 2024 by RedirectionBot (talk | contribs) (‎Removed claim: author (P16): Item:Q827403)
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

    Identifiers