Signed graphs with cut points whose positive inertia indexes are two

A signed graph Gσ consists of an underlying graph G and a sign function σ, which assigns each edge uv of G a sign σ(uv), either positive or negative. The adjacency matrix of Gσ is defined as A(Gσ)=(au,vσ) with au,vσ=σ(uv)au,v, where au,v=1 if u,v∈V(G) are adjacent, and au,v=0 otherwise. The positive...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Linear algebra and its applications 2018-02, Vol.539, p.14-27
Hauptverfasser: Wang, Xinlei, Wong, Dein, Tian, Fenglei
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A signed graph Gσ consists of an underlying graph G and a sign function σ, which assigns each edge uv of G a sign σ(uv), either positive or negative. The adjacency matrix of Gσ is defined as A(Gσ)=(au,vσ) with au,vσ=σ(uv)au,v, where au,v=1 if u,v∈V(G) are adjacent, and au,v=0 otherwise. The positive inertia index of Gσ, written as p(Gσ), is defined to be the number of positive eigenvalues of A(Gσ). Recently, Yu et al. (2016) [12] characterized the signed graphs Gσ with pendant vertices such that p(Gσ)=2. In this paper, we extend the above work to a more general case, characterizing the signed graphs Gσ with cut points whose positive inertia index is 2.
ISSN:0024-3795
1873-1856
DOI:10.1016/j.laa.2017.09.014