Absolute Mean Graceful Labeling in Path Union of Various Graphs

  • V J Kaneria Department of Mathematics, Saurashtra University, Rajkot, 360005,Gujarat, India
  • H P Chudasama Government Polytechnic, Rajkot, 360003, Gujarat, India
  • P P Andharia MRT and MSV Science college, Kaliyabid, Bhavnagar, 364002,Gujarat, India
Keywords: Absolute mean graceful labeling.

Abstract

Present paper aims to focus on absolute mean graceful labeling in path union of various graphs. We proved path union of graphs like tree, path Pn, cycle Cn, complete bipartite graph Km, n, grid graph PM × Pn, step grid graph Stn and double step grid graph DStn are absolute mean graceful graphs.

Downloads

Download data is not yet available.

References

Rosa A. (1967). On Certain Valuation of Graph Theory of Graphs (RomeJuly 1966), GodenandBreach, N. Y. and Paris, 349–355.

Golomb S. W. (1972). How to number a graph, in Graph Theory and Computing (R. C. Read. Ed.) AcademicPress. NewYo r k, 23–37.

Kaneria V. J., Makadia H. M. and Meghapara M. (2015). Graceful labelling for grid-related graphs, Int. J. of Mathematics and soft computing,5, 1, 111–117.

Kaneria V. J. and Makadia H. M. (2015). Graceful Labeling for Double Step Grid Graph, Int. J. of Mathematics and its applications,3, 1, 33–38.

Kaneria V. J. and Chudasama H. P. (2017). Absolute mean graceful labeling in various graphs, Int. J. of Mathematics and its applications, 5, 4-E, 723–726.

Gallian J. A. (2011). A dynamic survey of graph labelling, The Electronic Journal of Combinatorics,18 DS6.

Published
2018-09-06
How to Cite
V J Kaneria, H P Chudasama, & P P Andharia. (2018). Absolute Mean Graceful Labeling in Path Union of Various Graphs. Mathematical Journal of Interdisciplinary Sciences, 7(1), 51-56. Retrieved from https://mjis.chitkara.edu.in/index.php/mjis/article/view/15
Section
Articles