The Locating Rainbow Connection Number of the Edge Corona of a Graph with a Complete Graph
Ariestha Widyastuty Bustan, A.N.M Salman, Pritta Etriana Putri

TL;DR
This paper investigates the locating rainbow connection number of graphs formed by the edge corona of a graph with a complete graph, establishing tight bounds for this parameter.
Contribution
It determines the upper and lower bounds of the locating rainbow connection number for edge corona graphs involving complete graphs, proving these bounds are tight.
Findings
Established tight bounds for the locating rainbow connection number.
Analyzed the edge corona of a graph with a complete graph.
Provided theoretical results on graph coloring parameters.
Abstract
A graph has a locating rainbow coloring if every pair of its vertices can be connected by a path passing through internal vertices with distinct colors and every vertex generates a unique rainbow code. The minimum number of colors needed for a graph to have a locating rainbow coloring is referred to as the locating rainbow connection number of a graph. Let and be two connected, simple, and undirected graphs on disjoint sets of and vertices, and edges, respectively. For , the edge corona of and , denoted as , is constructed by using a single copy of and copies of , and then connecting the two end vertices of the -th edge of to every vertex in the -th copy of . In this paper, we determine the upper and lower bounds of the locating rainbow connection…
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 applications · Advanced Graph Theory Research
