Signless Laplacian polynomial and characteristic polynomial of a graph (Q2249916): Difference between revisions

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.