The rainbow vertex-index of complementary graphs
From MaRDI portal
Publication:307925
zbMath1346.05088MaRDI QIDQ307925
Zhao Wang, Fengnan Yanling, Chengfu Ye, Shu-Min Zhang
Publication date: 5 September 2016
Published in: Journal of Algebra, Combinatorics, Discrete Structures and Applications (Search for Journal in Brave)
\(k\)-rainbow vertex-indexcomplementary graphrainbow vertex \(S\)-treestrong rainbow vertex-connection number
Cites Work
- Unnamed Item
- Unnamed Item
- Nordhaus-Gaddum-type theorem for rainbow connection number of graphs
- Rainbow connections of graphs: a survey
- On the rainbow vertex-connection
- Nordhaus-Gaddum-type theorem for the rainbow vertex-connection number of a graph
- The rainbow connectivity of a graph
- On Complementary Graphs
- Rainbow connection in graphs
- The rainbow connection of a graph is (at most) reciprocal to its minimum degree
- The strong rainbow vertex-connection of graphs
This page was built for publication: The rainbow vertex-index of complementary graphs