Year: 2025
Type: article
Abstract: The concept of the locating rainbow connection number of a graph is an innovation in graph coloring theory that combines the concepts of rainbow vertex coloring and partition dimension on graphs. This concept aims to determine the smallest positive integer such that there exists a locating rainbow -coloring on the graph, ensuring that every vertex has a unique rainbow code. In this study, we investigate the locating rainbow connection number of the lollipop graph and barbell graph . Using a literature study method, hypotheses were formulated and proven through theoretical analysis. The results show that and .
Authors: Ariestha Widyastuty Bustan, Taufan Talib, Novita Serly Laamena, Lamanisa Rasid Saputra, Nurhayati Nurhayati
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
OpenAlex ID: W4413962032