Divided Square Difference Cordial Labeling of Some Cycle Related Graphs

Abstract

In this paper we prove the following results:

1. The path union of two copies of cycle Cn (n∈N, n3) is a divided square difference cordial graph.


2. The path union of two copies of cycle C1,1,n-2 (n  N, n5) with three chords is a divided square difference cordial graph, where three chords which by themselves forms a triangle.


3. The path union of two copies of wheel Wn(nϵN, n3) is a divided square difference cordial graph.


4. The path union of two copies of helm Hn (nϵN, n3) is a divided square difference cordial graph.


5. The path union of two copies of closed helm CHn(nϵN, n3) is a divided square difference cordial graph.

MSC 2010 Classifications: 05C78.