Difference Cordial of Operational Graph Related to Cycle

S. M. Vaghasiya, G. V. Ghodasara

Difference cordial, Cycle with one chord, Cycle with twin chord, cycle with triangle, Swastik graph.

Let G be a (p; q) graph. A bijective vertex labeling function f : V (G) ! f1; 2;pg is called adifference cordial labeling if for each edge uv, assign thelabel jf(u) ô€€€ f(v)j then jef (0) ô€€€ ef (1)j  1, where ef (1)and ef (0) denote the number of edges labeled with 1 and not labeled with 1 respectively. A graph with a difference cordial labeling is called a difference cordial graph. In this paper, we prove that cycle with one chord, cycle with twin chords and cycle with triangle admit difference cordial labeling.

10.22161/ijaers/3.9.32