Advanced
ON k-GRACEFUL LABELING OF SOME GRAPHS
ON k-GRACEFUL LABELING OF SOME GRAPHS
Journal of applied mathematics & informatics. 2016. Jan, 34(1_2): 9-17
  • Received : June 15, 2015
  • Published : January 30, 2016
Download
PDF
e-PUB
PubReader
PPT
Export by style
Article
Author
Metrics
Cited by
About the Authors
PRADHAN P.
KUMAR KAMESH

Abstract
In this paper, it has been shown that the hairy cycle C<sub>n</sub> �� rK<sub>1</sub>, n �� 3(mod4), the graph obtained by adding pendant edge to each pendant vertex of hairy cycle C<sub>n</sub> �� 1K<sub>1</sub>, n �� 0(mod4), double graph of path P<sub>n</sub> and double graph of comb P<sub>n</sub> �� 1K<sub>1</sub> are k-graceful.
Keywords
References