Consistency in the Naturally Vertex-Signed Line Graph of a Signed Graph
Combinatorics
2021-06-21 v2
Abstract
A signed graph is a graph whose edges are signed. In a vertex-signed graph the vertices are signed. The latter is called consistent if the product of signs in every circle is positive. The line graph of a signed graph is naturally vertex-signed. Based on a characterization by Acharya, Acharya, and Sinha in 2009, we give constructions for the signed simple graphs whose naturally vertex-signed line graph is consistent.
Cite
@article{arxiv.1404.1652,
title = {Consistency in the Naturally Vertex-Signed Line Graph of a Signed Graph},
author = {Thomas Zaslavsky},
journal= {arXiv preprint arXiv:1404.1652},
year = {2021}
}
Comments
7 pp. V2: minor errors corrected