THE LOCATING RAINBOW CONNECTION NUMBERS OF LOLLIPOP AND BARBELL GRAPHS
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 (ORCID: https://orcid.org/0000-0002-3264-1254)
- Novita Serly Laamena (ORCID: https://orcid.org/0009-0008-5267-5268)
- Taufan Talib (ORCID: https://orcid.org/0000-0002-9309-5453)
- Nurhayati Nurhayati (ORCID: https://orcid.org/0000-0003-2831-6114)
- Lamanisa Rasid Saputra
Institutions
- University of Washington (US)
- University of Pattimura (ID)
- Universitas Almuslim (ID)
- University of Washington Applied Physics Laboratory (US)
Publication Details
- Journal
- BAREKENG JURNAL ILMU MATEMATIKA DAN TERAPAN
- Published
- 2025-09-01
- DOI
- https://doi.org/10.30598/barekengvol19iss4pp2727-2738
- Primary Topic
- Graph Labeling and Dimension Problems
- Type
- article
- Field-Weighted Citation Impact
- 0.00