K- Equitable Labeling of Graphs

N. Sridharan and R. Umarani


Volume :1 , Issue :4 ,Page :191-201



Abstract :Cahit introduced the k- equitable labeling as a generaliza tion of graceful labeling. In this paper, we study on k- equitable labeling and we prove that the graph  n P is k- equitable for all k, n and the graph  n C is k-equitable if n (mod ) 2 k k  or 21 kn 



  • Download PDF