The rainbow vertex-index of complementary graphs

MaRDI QIDQ307925zbMATH OpenFDO

Authors Fengnan Yanling, Zhao Wang, Chengfu Ye, Shumin Zhang

Publication date 5 September 2016

Published in Journal of Algebra Combinatorics Discrete Structures and Applications (Search for Journal in Brave)

zbMATH Keywords

\(k\)-rainbow vertex-indexcomplementary graphrainbow vertex \(S\)-treestrong rainbow vertex-connection number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Recommendations

• scientific article; zbMATH DE number 6761154
• Some results on the 3-vertex-rainbow index of a graph
• The strong rainbow vertex-connection of graphs
• Note on the vertex-rainbow index of a graph
• The complexity of determining the vertex-rainbow index of graphs

Cites work

• Graph theory
• Nordhaus-Gaddum-type bounds for the rainbow vertex-connection number of a graph
• Nordhaus-Gaddum-type theorem for rainbow connection number of graphs
• On Complementary Graphs
• On the rainbow vertex-connection
• Rainbow connection in graphs
• Steiner tree problems in computer communication networks.
• The rainbow connection of a graph is (at most) reciprocal to its minimum degree
• The rainbow connectivity of a graph
• The strong rainbow vertex-connection of graphs

Cited in

(3)

• scientific article; zbMATH DE number 6761154 (Why is no real title available?)
• The vertex-rainbow index of a graph
• The complexity of determining the vertex-rainbow index of graphs

This page was built for publication: The rainbow vertex-index of complementary graphs

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