On the Laplacian coefficients of signed graphs

Let Γ=(G,σ) be a signed graph, where G is its underlying graph and σ its sign function (defined on edges of G). A signed graph Γ′, the subgraph of Γ, is its signed TU-subgraph if the signed graph induced by the vertices of Γ′ consists of trees and/or unbalanced unicyclic signed graphs. Let L(Γ)=D(G)...

Full description

Saved in:
Bibliographic Details
Published in:Linear algebra and its applications 2015-06, Vol.475, p.94-113
Main Authors: Belardo, Francesco, Simić, Slobodan K.
Format: Article
Language:English
Subjects:
Laplacian coefficients
Line graph
Signed graph
Subdivision graph
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Let Γ=(G,σ) be a signed graph, where G is its underlying graph and σ its sign function (defined on edges of G). A signed graph Γ′, the subgraph of Γ, is its signed TU-subgraph if the signed graph induced by the vertices of Γ′ consists of trees and/or unbalanced unicyclic signed graphs. Let L(Γ)=D(G)−A(Γ) be the Laplacian of Γ. In this paper we express the coefficient of the Laplacian characteristic polynomial of Γ based on the signed TU-subgraphs of Γ, and establish the relation between the Laplacian characteristic polynomial of a signed graph with adjacency characteristic polynomials of its signed line graph and signed subdivision graph. As an application, we identify the signed unicyclic graphs having extremal coefficients of the Laplacian characteristic polynomial.
ISSN:0024-3795
1873-1856
DOI:10.1016/j.laa.2015.02.007