The vertex-rainbow connection number of some graph operations

DOI10.7151/DMGT.2206MaRDI QIDQ2227111zbMATH OpenOpenAlexWikidataFDO

Authors Hengzhe Li, Yingbin Ma, Xueliang Li

Publication date 10 February 2021

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

Full work available at URL https://doi.org/10.7151/dmgt.2206

zbMATH Keywords

Cartesian productlexicographic productline graphrainbow connection numbervertex-rainbow connection number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• Rainbow vertex-connection and graph products
• Graphs with vertex rainbow connection number two
• Nordhaus-Gaddum-type bounds for the rainbow vertex-connection number of a graph
• Rainbow connection number and graph operations
• Rainbow vertex connection number of dense and sparse graphs.

Cites work

• A note on the minimum size of k-rainbow-connected graphs
• Further hardness results on the rainbow vertex-connection number of graphs
• Graph theory
• Graphs with vertex rainbow connection number two
• Hardness and algorithms for rainbow connection
• scientific article; zbMATH DE number 1484052 (Why is no real title available?)
• scientific article; zbMATH DE number 223376 (Why is no real title available?)
• Note on minimally \(d\)-rainbow connected graphs
• Note on the rainbow k-connectivity of regular complete bipartite graphs.
• On minimally rainbow k-connected graphs
• On rainbow connection
• On the rainbow connection of Cartesian products and their subgraphs
• Oriented diameter and rainbow connection number of a graph
• Rainbow connection and graph products
• Rainbow connection in 3-connected graphs
• Rainbow connection in graphs
• Rainbow connection number and connected dominating sets
• Rainbow connection number and connectivity
• Rainbow connection number and graph operations
• Rainbow connection number and radius
• Rainbow connection number of graph power and graph products
• Rainbow connection number of graphs with diameter 3
• Rainbow connection of graphs with diameter 2
• Rainbow connections for outerplanar graphs with diameter 2 and 3
• Rainbow vertex \(k\)-connection in graphs
• Rainbow vertex-connection and graph products
• The complexity of determining the rainbow vertex-connection of a graph
• The minimum size of \(k\)-rainbow connected graphs of given order
• The rainbow connection number of 2-connected graphs
• The rainbow connection of a graph is (at most) reciprocal to its minimum degree
• The rainbow connectivity of a graph
• Tight upper bound of the rainbow vertex-connection number for 2-connected graphs

Cited in

(3)

• scientific article; zbMATH DE number 6795188 (Why is no real title available?)
• On the locating rainbow connection number of the comb product with complete graphs or trees
• The vertex-rainbow index of a graph

This page was built for publication: The vertex-rainbow connection number of some graph operations

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