Parity labeling in Signed Graphs

Title

Parity labeling in Signed Graphs

Creator

Acharya M.; Kureethara J.V.

Description

Let S = (G; ?) be a signed graph where G = (V;E) is a graph called the underlying graph of S and ?: E(G) ? {+; -}. Let f: V(G) ? {1, 2, ..., |V(G)|} such that ?(uv) = + if f(u) and f(v) are of same parity and ?(uv) = - if f(u) and f(v) are of opposite parity. The bijection f induces a signed graph Gf denoted as S, which is a parity signed graph. In this paper, we initiate the study of parity labeling in signed graphs. We define and find `rna' number denoted as ?-(S) 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. 2021, Journal of Prime Research in Mathematics. All rights reserved.

Source

Journal of Prime Research in Mathematics, Vol-17, No. 2, pp. 1-7.

Date

2021-01-01

Publisher

Abdus Salam School of mathematical Sciences

Subject

Graph labeling; Parity labeling; Parity signed graph; Signed graph

Coverage

Acharya M., CHRIST (Deemed to be University), Karnataka, Bangalore, 560029, India; Kureethara J.V., CHRIST (Deemed to be University), Karnataka, Bangalore, 560029, India

Rights

Restricted Access

Relation

ISSN: 18173462

Format

Online

Language

English

Type

Article

Identifier

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85114096832&partnerID=40&md5=9578a7754eb857f1d84d1045b4e3deea