Rainbow connection number of graph power and graph products

DOI10.1007/s00373-013-1355-3zbMath1306.05203arXiv1104.4190OpenAlexW1963839880MaRDI QIDQ489302

Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad, Arunselvan Ramaswamy

Publication date: 20 January 2015

Published in: Graphs and Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

Cartesian productstrong productlexicographic productgraph powerrainbow coloring

Mathematics Subject Classification ID

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

Related Items (10)

Rainbow colouring of split graphs ⋮ Rainbow connection number and graph operations ⋮ Proper connection of direct products ⋮ Rainbow connections of graphs: a survey ⋮ On inertia and ratio type bounds for the \(k\)-independence number of a graph and their relationship ⋮ The vertex-rainbow connection number of some graph operations ⋮ Rainbow connection number of generalized composition ⋮ Rainbow vertex-connection and graph products ⋮ The rainbow 2-connectivity of Cartesian products of 2-connected graphs and paths ⋮ Rainbow 2-connectivity of edge-comb product of a cycle and a Hamiltonian graph

Cites Work

• Unnamed Item
• Unnamed Item
• Rainbow connection number and connectivity
• Hardness and algorithms for rainbow connection
• Rainbow connection number and radius
• On rainbow connection
• Rainbow connections of graphs: a survey
• Rainbow connection and graph products
• On the rainbow connection of Cartesian products and their subgraphs
• Rainbow connection number and connected dominating sets
• Rainbow connection in graphs
• The rainbow connection of a graph is (at most) reciprocal to its minimum degree

This page was built for publication: Rainbow connection number of graph power and graph products