Note on the vertex-rainbow index of a graph
From MaRDI portal
Publication:2048994
DOI10.1007/s40840-021-01092-0zbMath1473.05099MaRDI QIDQ2048994
Xiaoyan Zhang, Yan Zhao, Fengwei Li
Publication date: 24 August 2021
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40840-021-01092-0
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Tight upper bound of the rainbow vertex-connection number for 2-connected graphs
- The vertex-rainbow index of a graph
- On rainbow connection
- Spanning trees in graphs of minimum degree 4 or 5
- On total rainbow \(k\)-connected graphs
- Rainbow connections of graphs: a survey
- Rainbow connection number and graph operations
- The rainbow connectivity of a graph
- Rainbow trees in graphs and generalized connectivity
- Spanning Trees with Many Leaves
- Rainbow connection in graphs
- The rainbow connection of a graph is (at most) reciprocal to its minimum degree