The minimum size of graphs with given rainbow index
From MaRDI portal
Publication:4645589
Abstract: The concept of -rainbow index of a connected graph , introduced by Chartrand, Okamoto and Zhang, is a natural generalization of the rainbow connection number. Let denote the minimum size of a connected graph of order with , where and . In this paper, we obtain some exact values and some upper bounds for .
Recommendations
Cited in
(17)- On minimally rainbow k-connected graphs
- The 3-rainbow index of a graph
- More on the minimum size of graphs with given rainbow index
- Graphs with 4-rainbow index 3 and \(n-1\)
- The (k,)-rainbow index of random graphs
- The 3-rainbow index and connected dominating sets
- Solutions to conjectures on the (k,)-rainbow index of complete graphs
- Smallest k-rainbow connected graphs for large k
- Note on the upper bound of the rainbow index of a graph
- Rainbow trees in graphs and generalized connectivity
- Rainbow trees in small cubic graphs
- The \((k,\ell)\)-rainbow index for complete bipartite and multipartite graphs
- Some upper bounds for the 3-rainbow index of line graphs.
- A note on graphs with prescribed order and rainbow index
- The minimum size of \(k\)-rainbow connected graphs of given order
- A note on the minimum size of k-rainbow-connected graphs
- A survey on rainbow (vertex-)index of graphs
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)