On cordial labeling of double duplication for some families of graph
L. Shobana, F. Remigius Perpetua Mary · Journal of Physics Conference Series · 2018
Let G (V, E) be a simple undirected graph where V,E are its vertex set and edge set respectively. Consider a labeling where f bea function from the vertices of G to {0, 1} and for each edge xy assign the label|f(x)-f(y)|. Then f is called cordial of G if the number of vertices labeled 0 and the number of vertices labeled 1 differs by at most 1 and the number of edges labeled 0 and the number of edges labeled 1 differs by at most 1. In this paper we proved the existence of cordial labeling for double duplication of path graph P n : n≥2, cycle graph C n : n≥3 except for n≡2 (mod 4), wheel graph W n :n≥5 except for n≥3 (mod 4), flower graph F n : n≥5 and bistar graph B m , n : m,n≥2.