A Study on Divisor Cordial Graphs |
Author(s): |
| S. Ananth , Sri Krishna Arts And Science College,Coimbatore; A. Elsy Gnana Pushpam, Sri Krishna Arts And Science College,Coimbatore; N. Arul Selvam, Sri Krishna Arts And Science College,Coimbatore; R. Arjun, Sri Krishna Arts And Science College,Coimbatore; V. Surya, Sri Krishna Arts And Science College,Coimbatore |
Keywords: |
Abstract |
|
In this chapter, we introduce a new concept called divisor cordial labeling. A divisor cordial labeling of a graph G with vertex set V is a bijection f from V to {1, 2, . . . , | V |} such that if each edge uv is assigned the label 1 if f(u) divides f(v) or f(v) divides f(u) and 0 otherwise, then the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1.In this chapter, we have proved that the standard graphs such as path, cycle, wheel, star and some complete bipartite graphs are divisor cordial. We have also proved that complete graph is not divisor cordial. We show that the special graphs G*K1,n , G*K2,n and G*K3,n are divisor cordial. |
Other Details |
|
Paper ID: IJSRDV5I120299 Published in: Volume : 5, Issue : 12 Publication Date: 01/03/2018 Page(s): 391-394 |
Article Preview |
|
|
|
|
