On the r-Hued Edge Chromatic Number of Corona Products of Ladder, Cycle, and Wheel Graphs
Keywords:
r-hued edge chromatic number, corona product, ladder graph, cycle graph, wheel graph.
Abstract
This paper explores the concept of r-hued edge coloring in simple graphs, wherein each edge must be adjacent to at least minrdeg(e) edges of distinct colors, where deg(e) denotes the number of edges adjacent to a given edge e. The minimum number of colors required to achieve such a coloring in a graph G is known as the r-hued edge chromatic number, denoted by r(G). We compute r(G) for various graph constructions involving corona products,speci cally focusing on combinations of ladder graphs, cycle graphs, and wheel graphs.
Published
2026-02-25
How to Cite
S, P., & V C, T. R. (2026). On the r-Hued Edge Chromatic Number of Corona Products of Ladder, Cycle, and Wheel Graphs . Statistics, Optimization & Information Computing. https://doi.org/10.19139/soic-2310-5070-2910
Issue
Section
Research Articles
Authors who publish with this journal agree to the following terms:
- Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.
- Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.
- Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).
