Parity Labeling in Signed Graphs
Mukti Acharya, Joseph Varghese Kureethara

TL;DR
This paper introduces the concept of parity labeling in signed graphs, defines the 'rna' number, and characterizes certain classes of parity signed graphs, opening new research directions in graph theory.
Contribution
It initiates the study of parity labeling in signed graphs, defines the 'rna' number, and characterizes some classes of parity signed graphs.
Findings
Defined the 'rna' number for signed graphs
Characterized certain classes of parity signed graphs
Proposed directions for future research
Abstract
Let be a signed graph where is a graph called the underlying graph of and . Let such that if and only if and are of same parity and if and only if and are of opposite parity. Under we get a signed graph denoted as , which is a parity signed graph. In this paper, we initiate the study of parity labeling in signed graphs and we define and find `rna' number denoted as for some classes of signed graphs. We also characterize some signed graphs which are parity signed graphs. Some directions for further research are also suggested.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems · Data Management and Algorithms · Advanced Graph Theory Research
