Ring sum of graphs
1 article · search the full text for this term
-
Integer Cordial Labeling in context of Ring sum of Graphs
Abstract: An Integer Cordial Labeling of a graph G*(p, q) is an one-one map g: V * or as p is even or odd, which induces an edge labeling defined by such that the number of edges labeled 1 and the number of edges labeled 0 differ by at most 1. If a graph has integer cordial labeling (I.C.L.), then it is called integer cordial graph (I.C.G.). In this paper, I …
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 10, Issue 2, 2023 Read article