The vertex-rainbow connection number of some graph operations

DOI10.7151/DMGT.2206zbMATH Open1458.05077OpenAlexW2915868931WikidataQ128325031 ScholiaQ128325031MaRDI QIDQ2227111FDOQ2227111

Authors: Hengzhe Li, Yingbin Ma, Xueliang Li 

Publication date: 10 February 2021

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

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

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.

zbMATH Keywords

line graphCartesian productlexicographic productrainbow connection numbervertex-rainbow connection number

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• The vertex-rainbow index of a graph
• On the locating rainbow connection number of the comb product with complete graphs or trees
• Title not available (Why is that?)

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)