Signless Laplacian Polynomial and Characteristic Polynomial of a Graph. (20th December 2012)

• Record Type: Journal Article
• Authors: Ramane, Harishchandra S.; Gudimani, Shaila B.; Shinde, Sumedha S.
• Other Names: Das Kinkar C. Academic Editor.
• Is Part Of: Journal of discrete mathematics. Volume 2013(2013)
• Publication Date: 2012-12-20
• Subjects: Computer science -- Mathematics -- Periodicals; Computer science -- Mathematics; Periodicals; 511.1
• DOI: 10.1155/2013/105624
• Languages: English
• ISSNs: 2090-9837

Abstract

Abstract : 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 graph and subdivision graph in terms of the characteristic polynomial of induced subgraphs.