Signless Laplacian polynomial and characteristic polynomial of a graph (Q2249916)

From MaRDI portal
Revision as of 07:14, 2 February 2024 by Import240129110113 (talk | contribs) (Added link to MaRDI item.)
scientific article
Language Label Description Also known as
English
Signless Laplacian polynomial and characteristic polynomial of a graph
scientific article

    Statements

    Signless Laplacian polynomial and characteristic polynomial of a graph (English)
    0 references
    0 references
    0 references
    4 July 2014
    0 references
    Summary: The signless Laplacian polynomial of a graph \(G\) is the characteristic polynomial of the matrix \(Q(G)= D(G)+A(G)\), where \(D(G)\) is the diagonal degree matrix and \(A(G)\) is the adjacency matrix of \(G\). In this paper we express the signless Laplacian polynomial in terms of the characteristic polynomial of the induced subgraphs, and, for regular graph, the signless Laplacian polynomial is expressed in terms of the derivatives of the characteristic polynomial. Using this we obtain the characteristic polynomial of line graphs and subdivision graphs in terms of the characteristic polynomial of induced subgraphs.
    0 references
    characteristic polynomial of induced subgraphs
    0 references
    characteristic polynomial of line graphs
    0 references
    characteristic polynomial of subdivision graphs
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references