The vertex-rainbow index of a graph

DOI10.7151/dmgt.1887zbMath1339.05056arXiv1502.00151MaRDI QIDQ726646

Yaping Mao

Publication date: 13 July 2016

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1502.00151

zbMATH Keywords

connectivity; vertex coloring; Nordhaus-Gaddum type; vertex-rainbow \(S\)-tree; vertex-rainbow index

Mathematics Subject Classification ID

05C05: Trees

05C15: Coloring of graphs and hypergraphs

05C40: Connectivity

05C76: Graph operations (line graphs, products, etc.)

Related Items

A survey on rainbow (vertex-)index of graphs, Proper connection number of graph products, Some results on the 3-vertex-rainbow index of a graph, Note on the vertex-rainbow index of a graph, Some results on the 3-total-rainbow index, The complexity of determining the vertex-rainbow index of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• The \((k,\ell)\)-rainbow index of random graphs
• Nordhaus-Gaddum-type theorem for rainbow connection number of graphs
• Note on minimally \(d\)-rainbow connected graphs
• On rainbow connection
• Rainbow connections of graphs: a survey
• A survey of Nordhaus-Gaddum type relations
• On minimally rainbow \(k\)-connected graphs
• The 3-rainbow index of a graph
• Graphs with 3-rainbow index \(n-1\) and \(n-2\)
• Graphs with 4-rainbow index 3 and \(n-1\)
• The complexity of determining the vertex-rainbow index of graphs
• Solutions to conjectures on the (k ,ℓ)-rainbow index of complete graphs
• On the rainbow vertex-connection
• Nordhaus-Gaddum-type theorem for the rainbow vertex-connection number of a graph
• The rainbow connectivity of a graph
• Rainbow trees in graphs and generalized connectivity
• On Complementary Graphs
• Rainbow connection in graphs
• Steiner distance in graphs
• The rainbow connection of a graph is (at most) reciprocal to its minimum degree