Search
9 articles for “E -cordial labeling”
-
E-Cordial Labeling for Theta Graph
Abstract: A binary vertex labeling f : E(G) → {0,1} with induced labeling f * : V(G) → {0,1} defined by f *(v) = ∑ { f (uv) : uv ϵ E(G)}(mod 2) is called an E-cordial labeling of graph G if the number of vertices labeled 0 and number of vertices labeled 1 differ by at most 1and the number of edges labeled 0 and number of edges labeled 1 …
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 5, Issue 1, 2018 · pp. 26–32 Read article
-
Context of Different Graph Operations: Fibonacci Product Cordial Labeling of Herschel Graph
Abstract: The function φ: V (G) → {F1, F2,..., Fn}, where Fj is the jth Fibonacci number (j = 1,..., n), is said to be Fibonacci product cordial labeling if the induced function φ*: E (G) → {0, 1} defined by 𝜑∗ (𝑢𝑣) = (𝜑(𝑢)𝜑 (𝑣))(𝑚𝑜𝑑 2) meets the criterion |𝑒𝜑∗(0) – � �𝜑∗(1)| ≤ 1. A graph known as the Fibonacci product cordial graph is one that permits Fibonacci product …
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 11, Issue 1, 2024 Read article
-
Fibonacci Cordial Labeling of Some Graphs
Abstract: An injective function f: V (G) → {F0, F1, F2, . . . , Fn+1}, where Fj is the jth Fibonacci number (j = 0, 1, . . . , n+1), is said to be Fibonacci cordial labeling if the induced function f ∗ : E(G) → {0, 1} defined by f ∗(uv) = (f (u) + f (v))(mod2) satisfies the condition |ef (0) − ef (1)| ≤ 1. A …
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 5, Issue 1, 2018 · pp. 1–4 Read article
-
Vertex Odd Divisor Cordial Labeling of Ring Sum of Different Graphs With star Graph
Abstract: A graph tt = (V, E) is said to have a vertex odd divisor cordial labeling if there is a bijection f : {1, 3, . . . , 2n − 1} such that each edge e = uv is assigned the label 1 if f (u)|f (v) or f (v)|f (u) and 0 otherwise, then the number of edges labeled with 0 and the number of edges labeled with …
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 5, Issue 2, 2018 · pp. 1–9 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
-
Sum Divisor Cordial Labeling of Wheel Related Graph Families
Abstract: In this paper, we prove that the graphs obtained by switching of a rim in wheel Wn, switching of a vertex of degree 2 and 3 in gear graph Gn, switching of a vertex of degree 2 and 4 in flower graph fln, switching of a vertex of degree 2 and 3 in shell graph Sn are sum divisor cordial (SDC). A sum divisor cordial labeling (SDCL) of a graph …
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 9, Issue 1, 2022 · pp. 31–39 Read article
-
Fibonacci Divisor Cordial Labeling of Different Graphs
Abstract: Fibonacci divisor of graph G with vertex set V (G)-Bijection f: V (G) → {F1, F2 ,. .. .. , Fp}, where Fi is the ith Fibonacci number. Therefore, if label 1 is assigned to each edge uv, if f (u) | f (v) or f (v) | f (u), mark 0 otherwise, then 0. The number of edges marked with 1 differs from the number of edges marked with …
Published in Research & Reviews: Discrete Mathematical Structures · Vol. 8, Issue 2, 2021 · pp. 38–45 Read article
-
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 · pp. 21–27 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