Indian Journal of Science and Technology

Open Access Open Access  Restricted Access Subscription Access

Graceful and Skolem Graceful Labeling in Extended Duplicate Graph of Path


Affiliations
1 Department of Mathematics, S.I.V.E.T. College, Gowrivakkam, Chennai–600 073, India
 

In this paper, we prove that the Extended Duplicate Graph of Path is Graceful and Skolem-graceful. AMS subject classification: 05C78

Keywords

Graph Labeling, Graceful Labeling, Skolem-graceful Labeling, Extended Duplicate Graph
User

  • Gallian JA (2010) A dynamic survey of graph labeling. Elec. J. Combin. 17, # DS6.

  • Golomb SW (1997) How to number a graph, in graph theory and computing, RC Read, ed., Academic press, NY. pp:23-37.

  • Lee SM, Wang S and Wui I (1988) On Skolemgracefulness of 4 stars. Congr. Number. 62, 235-239.

  • Rosa A (1967) On certain valuations of the vertices of a graph, theory of graphs (Int. Symp. Rome, July 1966), Gordon and Breech NY and Dunod paris.pp:349-355.

  • Thirusangu K, Ulaganathan PP and Selvam B (2010) Cordial labeling in duplicate graphs. Int. J. Computer Math. Sci. Appl. 4(1-2), 179-186.

  • Youssef MZ (2003) New families of graceful graphs. Ars. Combin. 67, 303-311


Abstract Views: 400

PDF Views: 124




  • Graceful and Skolem Graceful Labeling in Extended Duplicate Graph of Path

Abstract Views: 400  |  PDF Views: 124

Authors

P. P. Ulaganathan
Department of Mathematics, S.I.V.E.T. College, Gowrivakkam, Chennai–600 073, India
K. Thirusangu
Department of Mathematics, S.I.V.E.T. College, Gowrivakkam, Chennai–600 073, India
B. Selvam
Department of Mathematics, S.I.V.E.T. College, Gowrivakkam, Chennai–600 073, India

Abstract


In this paper, we prove that the Extended Duplicate Graph of Path is Graceful and Skolem-graceful. AMS subject classification: 05C78

Keywords


Graph Labeling, Graceful Labeling, Skolem-graceful Labeling, Extended Duplicate Graph

References





DOI: https://doi.org/10.17485/ijst%2F2011%2Fv4i2%2F29943