An Algorithm for Odd Graceful Labeling of the Union of Paths and Cycles
DOI: 10.5121/jgraphhoc.2010.2108 ↗Kurz gefasst
Fachartikel in der Zeitschrift International Journal on Applications of Graph Theory In wireless Ad Hoc Networks And sensor Networks, 2010. Verfasst von Ibrahim Moussa M. Die Arbeit wurde bisher 1-mal zitiert (Crossref).
Abstract (Originalsprache)
In 1991, Gnanajothi [4] proved that the path graph P_n with n vertex and n-1 edge is odd graceful, and the cycle graph C_m with m vertex and m edges is odd graceful if and only if m even, she proved the cycle graph is not graceful if m odd. In this paper, firstly, we studied the graph C_m $\cup$ P_m when m = 4, 6,8,10 and then we proved that the graph C_ $\cup$ P_n is odd graceful if m is even. Finally, we described an algorithm to label the vertices and the edges of the vertex set V(C_m $\cup$ P_n) and the edge set E(C_m $\cup$ P_n).
Zitieren
APA
M, I. M. (2010). An Algorithm for Odd Graceful Labeling of the Union of Paths and Cycles. International Journal on Applications of Graph Theory In wireless Ad Hoc Networks And sensor Networks. https://doi.org/10.5121/jgraphhoc.2010.2108
Vancouver
M IM. An Algorithm for Odd Graceful Labeling of the Union of Paths and Cycles. International Journal on Applications of Graph Theory In wireless Ad Hoc Networks And sensor Networks. 2010. doi:10.5121/jgraphhoc.2010.2108
BibTeX
@article{M2010,
author = {M, Ibrahim Moussa},
title = {An Algorithm for Odd Graceful Labeling of the Union of Paths and Cycles},
journal = {International Journal on Applications of Graph Theory In wireless Ad Hoc Networks And sensor Networks},
year = {2010},
doi = {10.5121/jgraphhoc.2010.2108}
}
EUVIMED