A structural approach to the graceful coloring of a subclass of trees

Let M={1,2,..m} and G be a simple graph. A graceful m-coloring of G is a proper vertex coloring of G using the colors in M which leads to a proper edge coloring using M∖{m} colors such that the associated color of each edge is the absolute difference between their end vertices. The graceful chromati...

Full description

Bibliographic Details
Main Authors: Laavanya D, Devi Yamini S
Format: Article
Language:English
Published: Elsevier 2023-09-01
Series:Heliyon
Subjects:
Online Access:http://www.sciencedirect.com/science/article/pii/S2405844023067713