Dividing Graceful Labeling of Certain 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 .