Quotient-4 cordial labeling of some unicyclic graphs-paper-I.

Let G (V, E) be a simple graph with p vertices and q edges. Let φ: V (G)→Z5 – {0} be a function and φ*: E(G)→Z4 defined by φ * (u v) = ⌈ φ (u) φ (v) ⌉ (modulo 4) where φ (u) ≥ φ (v).. If | v φ (i) − v φ (j) | ≤ 1 , 1 ≤ i , j ≤ 4, i ≠ j and |e φ (k) - e φ (1) | ≤ 1 , 0 ≤ k , l ≤ 3 , k ≠ l then φ is quotient-4 cordial labeling of G, where vφ(x) and eφ(y) denote the number of vertices labeled with x and the number of edges labeled with y. Here some unicycle graphs such as cycle graph, dragon graph, and crown graph are proved to be quotient-4 cordial graphs. [ABSTRACT FROM AUTHOR]