Decomposition of Product Path Graphs Into Graceful Graphs
Main Article Content
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
Article Details
You are free to:
- Share — copy and redistribute the material in any medium or format for any purpose, even commercially.
- Adapt — remix, transform, and build upon the material for any purpose, even commercially.
- The licensor cannot revoke these freedoms as long as you follow the license terms.
Under the following terms:
- Attribution — You must give appropriate credit , provide a link to the license, and indicate if changes were made . You may do so in any reasonable manner, but not in any way that suggests the licensor endorses you or your use.
- No additional restrictions — You may not apply legal terms or technological measures that legally restrict others from doing anything the license permits.
Notices:
You do not have to comply with the license for elements of the material in the public domain or where your use is permitted by an applicable exception or limitation .
No warranties are given. The license may not give you all of the permissions necessary for your intended use. For example, other rights such as publicity, privacy, or moral rights may limit how you use the material.