z-logo
open-access-imgOpen Access
Signless Laplacian Polynomial and Characteristic Polynomial of a Graph
Author(s) -
Harishchandra S. Ramane,
Shaila B. Gudimani,
Sumedha Shinde
Publication year - 2013
Publication title -
journal of discrete mathematics
Language(s) - English
Resource type - Journals
eISSN - 2090-9837
pISSN - 2090-9845
DOI - 10.1155/2013/105624
Subject(s) - algorithm , computer science
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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom