The minimum Laplacian spread of unicyclic graphs (Q1044538)

From MaRDI portal
scientific article
Language Label Description Also known as
English
The minimum Laplacian spread of unicyclic graphs
scientific article

    Statements

    The minimum Laplacian spread of unicyclic graphs (English)
    0 references
    0 references
    0 references
    18 December 2009
    0 references
    The Laplacian spread of a graph is defined as the difference between the largest eigenvalue and the second-smallest eigenvalue of the associated Laplacian matrix. In this paper, the minimum Laplacian spread of unicyclic graphs with given order is determined.
    0 references
    0 references
    Laplacian spread
    0 references
    Laplacian matrix
    0 references
    eigenvalue
    0 references
    unicyclic graphs
    0 references
    algebraic connectivity
    0 references
    0 references
    0 references