Characterization of Line-Cut Signed Graphs

Autor: Jain, Rashmi, Acharya, Mukti, Kansal, Sangita
Zdroj: National Academy Science Letters; 20240101, Issue: Preprints p1-4, 4p
Abstrakt: A signed graphS=(Su,σ)consists of an underlying graph Suand a function σ:E(Su)⟶{+,-}. For a graph G, its lict graph written as Lc(G)is the intersection graph Ω(E(G)∪C(G)). For a signed graph S, its line-cutsigned graph(in short called lict signed graph) is denoted by Lc(S)has underlying graph Lc(Su)and two vertices uand vjoint by negative edge if uand vboth are negative adjacent edges of Sor uis a negative edge incident to a cut-vertex vof negative degree odd in Sand by positive edge otherwise, here C(S) is the set of cut-vertices of S. In this paper, we establish structural characterization of lict signed graphs Lc(S).
Databáze: Supplemental Index