3 papers
math.CO2024
The Rainbow Connection Number of The Commuting Graph of a Finite Nonabelian Group
Rian Febrian Umbara, A. N. M. Salman, Pritta Etriana Putri
A path in an edge-colored graph is called a rainbow path if every two distinct edges of the path have different colors. A graph whose every pair of vertices are linked by a rainbow…
math.CO2024
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
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…
math.CO2024
Determining the Locating Rainbow Connection Number of Vertex-Transitive Graphs
Ariestha Widyastuty Bustan, ANM Salman, Pritta Etriana Putri
The locating rainbow connection number of a graph is defined as the minimum number of colors required to color vertices such that every two vertices there exists a rainbow vertex p…