Decomposition of Product Path Graphs Into Graceful Graphs

Main Article Content

P.M.Sudha, et. al.

Abstract

A decomposition of is a collection  such that are edge disjoint and every edge in belongs to. If each  is a graceful graph, then is called a graceful decomposition of. The minimum cardinality of a graceful decomposition of  is called the graceful decomposition number of and it is denoted by In this paper, we define graceful decomposition and graceful decomposition number of a graphs. Also, some bounds of in product graphs like Cartesian product, composition etc. are investigated.

Downloads

Download data is not yet available.

Metrics

Metrics Loading ...

Article Details

How to Cite
et. al., P. . (2021). Decomposition of Product Path Graphs Into Graceful Graphs. Turkish Journal of Computer and Mathematics Education (TURCOMAT), 12(10), 4719–4726. Retrieved from https://turcomat.org/index.php/turkbilmat/article/view/5226
Section
Research Articles