Characterization of line-consistent signed graphs

From MaRDI portal
Publication:2516686



Abstract: The line graph of a graph with signed edges carries vertex signs. A vertex-signed graph is consistent if every circle (cycle, circuit) has positive vertex-sign product. Acharya, Acharya, and Sinha recently characterized line-consistent signed graphs, i.e., edge-signed graphs whose line graphs, with the naturally induced vertex signature, are consistent. Their proof applies Hoede's relatively difficult characterization of consistent vertex-signed graphs. We give a simple proof that does not depend on Hoede's theorem as well as a structural description of line-consistent signed graphs.












This page was built for publication: Characterization of line-consistent signed graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2516686)