On the r-Hued Edge Chromatic Number of Corona Products of Ladder, Cycle, and Wheel Graphs
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.
Fields of Study & Subjects
Graph Labeling and Dimension Problems
Advanced Graph Theory Research
Graph theory and applications
Publication details
- Journal / source
- Statistics Optimization & Information Computing
- Volume
- 15
- Issue
- 5
- Pages
- 3697–3705
- Publication date
- 25 February 2026
- Language
- EN