D. Bharathi

Even-Odd Cordial Labeling on Join of Zero Divisor Graphs

Let G(V,E) be a graph, and let f: V(G) →{1,2,….|𝑉(𝐺)|} be a bijective vertex labeling. The induced edge labeling f*: E(G) → {0,1} is defined by assigning the label 1 to an edge uv whenever the labels f(u) and f(v) have same parity, and the label 0 whenever they have different parities. If the difference between the num...