Search
1 article for “Theta graph”
-
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