Search
3 articles for “Double wheel graph”
-
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
-
Difference Cordial Labeling in context of Joint sum of Graphs
Abstract: Suppose G be a (p, q) graph. Suppose f be a map from f(G) to {1,2,...,p}. For each edge xy assign, the label |f(x) – f(y)|. f is difference cordial if f is 1-1 and |ef(0) – ef(1)| 14≤"> 1, where ef(1) and ef(0) denote the number of edges with labeled 1 except labeled with 1 respectively. A graph which admit difference cordial labeling is called a difference cordial graph. …
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 5, Issue 1, 2018 · pp. 21–25 Read article
-
Subtract Divisor Cordial Labeling of Ring Sum of a Graphs
Abstract: Abstract: A subtract divisor cordial labeling of a graph G with vertex set is a bijection f from V to {1, 2,…, |V|} such that an edge is assigned the label 1 if 2 divides (f(u) – f(v)) and 0 otherwise, then number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. A graph with a subtract divisor cordial labeling is …
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 6, Issue 3, 2019 · pp. 23–28 Read article