Dividing Graceful Labeling of Certain Tree Graphs

  • Abdullah Zahraa O
  • Arif Nabeel E
  • , F. A. Fawzi


A tree is a connected acyclic graph on n vertices and m edges. graceful  labeling of a tree  defined as a simple undirected graph G(V,E) with order n and size m,  if there exist an injective mapping  that induces a bijective mapping  defined by   for each      and . In this paper we introduce a new type of graceful labeling denoted dividing graceful then discuss this type of certain tree graphs .



Aug 2, 2020
How to Cite
ZAHRAA O, Abdullah; NABEEL E, Arif; FAWZI, , F. A.. Dividing Graceful Labeling of Certain Tree Graphs. Tikrit Journal of Pure Science, [S.l.], v. 25, n. 4, p. 123-126, aug. 2020. ISSN 2415-1726. Available at: <http://tjps.tu.edu.iq/index.php/j/article/view/1025>. Date accessed: 22 jan. 2021. doi: http://dx.doi.org/10.25130/j.v25i4.1025.