An Analysis of Graceful Coloring in a Specific r-Regular Graphs
Laavanya D., Devi Yamini S.

TL;DR
This paper investigates the graceful chromatic number of a specific class of regular graphs, focusing on complete graphs, using a set theoretic approach to address an open problem in graph coloring.
Contribution
It introduces a set theoretic method for computing the graceful chromatic number of complete graphs and characterizes graphs based on their graceful chromatic number.
Findings
Computed graceful chromatic number for complete graphs.
Provided characterizations of graphs based on their graceful chromatic number.
Addressed an open problem in regular graph coloring.
Abstract
A graceful -coloring of a graph is a proper vertex coloring with colors which induces a proper edge coloring with at most colors, where the color for an edge is the absolute difference between the colors assigned to the vertices and . The graceful chromatic number is the smallest for which permits graceful -coloring. The problem of computing the graceful chromatic number of regular graphs is still open, though the existence of the lower bound was proved in \cite{3}. Hence, we pay attention to the computation of the graceful chromatic number of a special class of regular graphs namely complete graphs using set theoretic approach. Also, a few characterization of graphs based on their graceful chromatic number were examined.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph Labeling and Dimension Problems · graph theory and CDMA systems · Advanced Graph Theory Research
