The rainbow vertex-index of complementary graphs

zbMATH Open1346.05088MaRDI QIDQ307925FDOQ307925

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)

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

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)

Cites Work

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

Cited In (3)

• Title not available (Why is that?)
• 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)