Sum Signed Graphs, Parity Signed Graphs and Cordial Graphs

Title

Sum Signed Graphs, Parity Signed Graphs and Cordial Graphs

Creator

Ranjith A.P.; Kureethara J.V.

Description

Signed graphs are graphs with every edge is signed either positive or negative. Given an n vertex graph, the vertices are bijectively labelled from 1 to n. A signed graph is a sum signed graph if and only if every edge is signed negative whenever the sum of the vertex labels exceeds n and every edge is signed positive whenever the sum of the vertex labels does not exceed n. For a parity signed graph, an edge receives a negative sign, if the end vertices are of opposite parity and a positive sign otherwise. Cordial signed graphs are the ones with the difference between the total number of negative edges and the positive ones is at most 1. We discuss the connection between sum signed labeling with parity signed labeling and cordial labeling. The absolute cordial condition for graphs satisfying sum signed labeling will be analyzed 2023, IAENG International Journal of Applied Mathematics.All Rights Reserved.

Source

IAENG International Journal of Applied Mathematics, Vol-53, No. 2

Date

2023-01-01

Publisher

International Association of Engineers

Subject

cordial labeling; parity signed graph; rna number; signed graph; sum signed graph

Coverage

Ranjith A.P., Department of Mathematics, Christ University, Karnataka, Bengaluru, 560029, India; Kureethara J.V., Department of Mathematics, Christ University, Karnataka, Bengaluru, 560029, India

Rights

Restricted Access

Relation

ISSN: 19929978

Format

Online

Language

English

Type

Article

Identifier

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