Volume : III, Issue : IV, April - 2014

A Study on Path Related Divisor Cordial Graphs

Dr. A. Nellai Murugan, Miss . V. Brinda Devi

Abstract :

A divisor cordial labeling of a graph G with vertex set V is a bijection from V to {1,2,....,|V|} such that if each edge uv is assigned the label 1 if f(u) / f(v) or f(v)/f(u) and 0 otherwise, then the number of edges labeled with 0 and the number of edges labeled with 1 differ by atmost 1. A graph which admits divisor cordial labeling is the divisor cordial graph. In this paper ,it is proved that Sp (p2 , k1,n), Sp (p3 ,k1 , n ),Sp (p4 ,k1 ,n), H_3 ? K_(1,n) are divisor cordial graphs

Keywords :

Article: Download PDF   DOI : 10.36106/ijsr  

Cite This Article:

Dr.A.NELLAI MURUGAN, Miss .V.BRINDA DEVI A Study on Path Related Divisor Cordial Graphs International Journal of Scientific Research, Vol.III, Issue. IV Apr 2014

Number of Downloads : 1432

References :