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

Let [Formula: see text] 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 [Formula: see text] colors such that the associated color of each edge is the absolute difference between their end vertices....

Descripción completa

Detalles Bibliográficos
Autores principales: D, Laavanya, S, Devi Yamini
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Elsevier 2023
Materias:
Research Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10558806/
https://www.ncbi.nlm.nih.gov/pubmed/37809615
http://dx.doi.org/10.1016/j.heliyon.2023.e19563

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10558806/
https://www.ncbi.nlm.nih.gov/pubmed/37809615
http://dx.doi.org/10.1016/j.heliyon.2023.e19563

Ejemplares similares