Graceful Coloring of Ladder Graphs
D Laavanya, S Devi Yamini

TL;DR
This paper investigates the graceful chromatic number of various ladder graph variants, providing new insights into their coloring properties and extending the understanding of graceful colorings in graph theory.
Contribution
It introduces new results on the graceful chromatic number for different variants of ladder graphs, expanding the existing knowledge in graph coloring theory.
Findings
Determined the graceful chromatic number for specific ladder graph variants.
Extended the theory of graceful colorings to new classes of ladder graphs.
Provided bounds and exact values for the graceful chromatic number in studied graphs.
Abstract
A graceful k-coloring of a non-empty graph is a proper vertex coloring , , which induces a proper edge coloring defined by , where . The minimum for which has a graceful -coloring is called graceful chromatic number, . The graceful chromatic number for a few variants of ladder graphs are investigated in this article.
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 · Advanced Graph Theory Research
