Some results on the 3-vertex-rainbow index of a graph
From MaRDI portal
Publication:2021678
DOI10.1007/s40840-020-00992-xzbMath1475.05071OpenAlexW3048909974MaRDI QIDQ2021678
Publication date: 27 April 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-020-00992-x
Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09)
Related Items (1)
Cites Work
- Unnamed Item
- Rainbow connections for outerplanar graphs with diameter 2 and 3
- Total rainbow connection number and complementary graph
- Total rainbow \(k\)-connection in graphs
- Rainbow connection number and connectivity
- The vertex-rainbow index of a graph
- Rainbow vertex connection of digraphs
- Rainbow connection numbers of Cayley digraphs on abelian groups
- Rainbow connections of graphs: a survey
- On minimally rainbow \(k\)-connected graphs
- The 3-rainbow index of a graph
- Graphs with 3-rainbow index \(n-1\) and \(n-2\)
- Rainbow connection number and graph operations
- Rainbow connection numbers of Cayley graphs
- Rainbow vertex \(k\)-connection in graphs
- On the rainbow vertex-connection
- Rainbow connection number and connected dominating sets
- Rainbow trees in graphs and generalized connectivity
- Rainbow connection in graphs
- The rainbow connection of a graph is (at most) reciprocal to its minimum degree
This page was built for publication: Some results on the 3-vertex-rainbow index of a graph