Ninda Ayu Agatya, Purwanto
Let G be a finite and simple graph. The distance of vertices u and v in G is a shortest u - v path in G, and it is denoted by d(u, v). A rainbow u - v geodesic is a u - v path of length d(u, v) and all its edges have different colors. If G contains a rainbow u - v geodesic for every two vertices u and v of G, then G is called strongly rainbow-connected. The minimum number of colors needed to make a graph G strongly rainbow-connected is called strong rainbow connection number of G and is denoted by src(G). Let m, n, and t be positive integers, m ≥ 3, n ≥ 2, and t ≥ 2m. A prism graph having t pendants, (Cm × Pn)t, is a graph obtained from a prism graph Cm × Pn by attaching t pendant edges, at least one pendant edge to each vertex of degree 3. In this paper we study src((Cm × P3)t) and find that src((Cm × P3)t) = t. © 2024 Author(s).
Department of Mathematics, Universitas Negeri Malang, Jalan Semarang 5, Malang, East Java, 65145, Indonesia
