The minimum size of graphs with given rainbow index

From MaRDI portal
Publication:4645589



Abstract: The concept of k-rainbow index rxk(G) of a connected graph G, introduced by Chartrand, Okamoto and Zhang, is a natural generalization of the rainbow connection number. Let t(n,k,ell) denote the minimum size of a connected graph G of order n with rxk(G)leqell, where 2leqellleqn−1 and 2leqkleqn. In this paper, we obtain some exact values and some upper bounds for t(n,k,ell).












This page was built for publication: The minimum size of graphs with given rainbow index

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645589)