Characterizations of Some Parity Signed Graphs
Combinatorics
2021-08-03 v3
Abstract
We describe parity labelings of signed graphs; equivalently, cuts of the underlying graph that have nearly equal sides. We characterize the balanced signed graphs which are parity signed graphs. We give structural characterizations of all parity signed stars, bistars, cycles, paths and complete bipartite graphs. The rna number of a graph is the smallest cut size that has nearly equal sides; we find it for a few classes of parity signed graphs.
Keywords
Cite
@article{arxiv.2006.03584,
title = {Characterizations of Some Parity Signed Graphs},
author = {Mukti Acharya and Joseph Varghese Kureethara and Thomas Zaslavsky},
journal= {arXiv preprint arXiv:2006.03584},
year = {2021}
}
Comments
12 pp., 3 figures. v3: revised manuscript