Math. J. Interdiscip. Sci.

Absolute Mean Graceful Labeling in Path Union of Various Graphs

V. J. Kaneria, H. P. Chudasama and P. P. Andharia

  • Download PDF
  • DOI Number

Absolute mean graceful labeling.

PUBLISHED DATE September 6, 2018
PUBLISHER The Author(s) 2018. This article is published with open access at

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.

Page(s) 51-56
ISSN Print: 2278-9561, Online: 2278-957X
  • A. Rosa, On Certain Valuation of the vertices of Graph in Theory of Graphs (Rome July 1966), Goden and Breach, N. Y. and Paris, 1967, pp. 349-355.
  • Solomon W. Golomb, How to number a graph, in Graph Theory and Computing (R. C. Read. Ed.), Academic Press. New York, (1972),pp. 23-37.
  • V. J. Kaneria, H. M. Makadia and Meera Meghapara, Graceful labeling for grid related graphs, Int. J. of Mathematics and soft computing, Vol. 5, No. 1 (2015), 111-117.
  • V. J. Kaneria and H. M. Makadia, Graceful Labeling for Double Step Grid Graph, Int. J. of Mathematics and its applications, Volume 3, Issue 1 (2015), 33-38.
  • V. J. Kaneria and H. P. Chudasama, Absolute mean graceful labeling in various graphs, Int. J. of Mathematics and its applications, Vol. 5, No. 4-E (2017), 723-726.
  • Joseph. A. Gallian, A dynamic survey of graph labeling, The Electronic Journal of Combinatorics (2017), #DS6.