Rainbow Connection Number in Pyramid Networks
Fu–Hsing Wang, Cheng-Ju Hsu · 2019
Rainbow connection number of a connected graph G is the minimum number of colors needed to color the edges of G, so that every pair of vertices is connected by at least one path whose edges have distinct colors. In this paper, we propose a linear time algorithm for constructing a rainbow coloring on pyramids.