Name
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. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.7151/dmgt.1825 | DISCUSSIONES MATHEMATICAE GRAPH THEORY |
Keywords | Field | DocType |
line-consistent signed graph,line graph,consistent vertex-signed graph,consistent marked graph | Block graph,Discrete mathematics,Outerplanar graph,Combinatorics,Comparability graph,Line graph,Pathwidth,Symmetric graph,Universal graph,Mathematics,Planar graph | Journal |
Volume | Issue | ISSN |
35 | 3 | 1234-3099 |
Citations | PageRank | References |
0 | 0.34 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Daniel C. Slilaty | 1 | 23 | 6.62 |
| T. Zaslavsky | 2 | 297 | 56.67 |