Name
Abstract | ||
|---|---|---|
We describe parity labellings 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 this for a few classes of graphs. |
Year | Venue | DocType |
|---|---|---|
2021 | AUSTRALASIAN JOURNAL OF COMBINATORICS | Journal |
Volume | ISSN | Citations |
81 | 2202-3518 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Acharya Mukti | 1 | 0 | 0.34 |
| Kureethara Joseph Varghese | 2 | 0 | 0.34 |
| T. Zaslavsky | 3 | 297 | 56.67 |