The Strong Rainbow Connection Numbers of Corona and Comb Product of Sandat and Path Graph Desi Rahmadani, Ainin Yusri Saputri, Purwanto
Universitas Negeri Malang
Abstract
The strong rainbow connection number is an extension of the rainbow connection numbers where it refers to the shortest path, commonly known as the geodesic path. If G is a connected graph and every pair of vertices in G has a geodesic path whose edges do not have the same color, then G is strongly rainbow connected. The fewest colors used so that G is strongly rainbow connected is called the strong rainbow connection number. In this paper, we will determine the strong rainbow connection numbers of graphs obtained from the corona and comb product of the sandat and path graph. In particular, we will prove that the graphs are strongly rainbow connected graphs.
