The Laplacian spread of tricyclic graphs (Q2380235)

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

    Statements

    The Laplacian spread of tricyclic graphs (English)
    0 references
    0 references
    0 references
    26 March 2010
    0 references
    Summary: The Laplacian spread of a graph is defined to be the difference between the largest eigenvalue and the second smallest eigenvalue of the Laplacian matrix of the graph. In this paper, we investigate Laplacian spread of graphs, and prove that there exist exactly five types of tricyclic graphs with maximum Laplacian spread among all tricyclic graphs of fixed order.
    0 references
    0 references
    Laplacian matrix of a graph
    0 references