Dividing Graceful Labeling of Certain Tree Graphs

Authors

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

DOI:

https://doi.org/10.25130/tjps.v25i4.281

Keywords:

: Graph theory, Graceful labeling ,Tree graphs

Abstract

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 .

Downloads

Published

2020-08-02

How to Cite

Abdullah Zahraa O, Arif Nabeel E, & F. A. Fawzi. (2020). Dividing Graceful Labeling of Certain Tree Graphs. Tikrit Journal of Pure Science, 25(4), 123–126. https://doi.org/10.25130/tjps.v25i4.281

Issue

Section

Articles

Categories