| Autor: |
Ariestha W. Bustan, A. N. M. Salman, Pritta E. Putri, Zata Y. Awanis |
| Jazyk: |
angličtina |
| Rok vydání: |
2023 |
| Předmět: |
|
| Zdroj: |
Emerging Science Journal, Vol 7, Iss 4, Pp 1260-1273 (2023) |
| Druh dokumentu: |
article |
| ISSN: |
2610-9182 |
| DOI: |
10.28991/ESJ-2023-07-04-016 |
| Popis: |
Locating the rainbow connection number of graphs is a new mathematical concept that combines the concepts of the rainbow vertex coloring and the partition dimension. In this research, we determine the lower and upper bounds of the locating rainbow connection number of a graph and provide the characterization of graphs with the locating rainbow connection number equal to its upper and lower bounds to restrict the upper and lower bounds of the locating rainbow connection number of a graph. We also found the locating rainbow connection number of trees and regular bipartite graphs. The method used in this study is a deductive method that begins with a literature study related to relevant previous research concepts and results, making hypotheses, conducting proofs, and drawing conclusions. This research concludes that only path graphs with orders 2, 3, 4, and complete graphs have a locating rainbow connection number equal to 2 and the order of graph G, respectively. We also showed that the locating rainbow connection number of bipartite regular graphs is in the range of r-⌊n/4⌋+2 to n/2+1, and the locating rainbow connection number of a tree is determined based on the maximum number of pendants or the maximum number of internal vertices. Doi: 10.28991/ESJ-2023-07-04-016 Full Text: PDF |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
