Year: 2026
Type: article
Abstract: Throughout this paper, G denotes a finite, simple, connected, and undirected graph. The concept of the locating rainbow edge connection number is motivated by the concept of the locating rainbow connection number in which the coloring is assigned to edges while preserving the locating property. The coloring focuses on determining the smallest natural number k such that there exists a locating rainbow edge -coloring of a graph such that every edge has a distinct rainbow code. In this paper, we define standard generalized sun graphs and leveled generalized sun graphs . We determine their locating rainbow edge connection numbers. The results are obtained through a theoretical approach and observations of graph structures with rigorous mathematical proofs. The results of Sun(n,p) and depend on their cycle order and the number of bridges.
Institution: Bandung Institute of Technology
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Keywords: bridges, edge coloring
Open Access status: diamond
OpenAlex ID: W7204263936
