Characterizations of some parity signed graphs
- Title
- Characterizations of some parity signed graphs
- Creator
- Acharya M.; Kureethara J.V.; Zaslavsky T.
- Description
- We describe parity labellings of signed graphs: equivalently, cuts of the underlying graph that have nearly equal sides. We characterize the bal-anced signed graphs which are parity signed graphs. We give structural characterizations of all parity signed stars, bistars, cycles, paths and com-plete 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. The author(s).
- Source
- Australasian Journal of Combinatorics, Vol-81, pp. 89-100.
- Date
- 2021-01-01
- Publisher
- University of Queensland
- Coverage
- Acharya M., Centre for Mathematical Needs, Christ University, Bengaluru, Karnataka, India; Kureethara J.V., Centre for Mathematical Needs, Christ University, Bengaluru, Karnataka, India; Zaslavsky T., Department of Mathematical Sciences, Binghamton University, Binghamton, NY, United States
- Rights
- Restricted Access
- Relation
- ISSN: 10344942
- Format
- Online
- Language
- English
- Type
- Article
Collection
Citation
Acharya M.; Kureethara J.V.; Zaslavsky T., “Characterizations of some parity signed graphs,” CHRIST (Deemed To Be University) Institutional Repository, accessed February 25, 2025, https://archives.christuniversity.in/items/show/15965.