Some upper bounds for 3-rainbow index of graphs (Q2829348)

The authors study the 3-rainbow index \(rx_3(G)\) of a connected graph \(G.\) They prove that \(rx_3(G)\leq rx_3(G[D])+4,\) where \(D\) is a connected 3-way dominating set and a connected 2-dominating set of \(G,\) which leads to an upper bound for graphs \(G\) with \(\delta(G)\geq 3\). Variations of these ideas are used to obtain sharp upper bounds of the 3-rainbow index of \(K_{s,t}\) (\(3\leq s\leq t\)) and of \((P_5,C_5)\)-free graphs.NEWLINENEWLINEThey also establish a sharp upper bound for \(rx_3(G)\) of a general connected graph \(G\) by block decomposition.