Some Theorems on Sum Divisor Cordial Graphs |
Author(s): |
Saraniya. V , SRI KRISHNA ARTS AND SCIENCE COLLEGE; Durgadevi. S, sri krishna arts and science college; Saranya. S, sri krishna arts and science college; Priyanka. K, sri krishna arts and science college |
Keywords: |
Sum Divisor Cordial Graphs |
Abstract |
A sum divisor cordial labeling of a graph G with vertex set V is a bijective function f from V(G) to {1, 2,…,|V (G)|} such that if 2 divides f (u) +f (v) then an edge uv is assigned the label 1 and 0 otherwise, then the number of edges labeled with 0 and 1 differ by at most 1. A graph is said to be sum divisor cordial graph if it has sum divisor labeling. This study proves that path, comb, star, complete bipartite, bistar, jewel, gear, crown are sum divisor cordial graphs. |
Other Details |
Paper ID: IJSRDV5I120191 Published in: Volume : 5, Issue : 12 Publication Date: 01/03/2018 Page(s): 304-307 |
Article Preview |
|
|