Rainbow connection number of amalgamation of some graphs

DOI10.1016/j.akcej.2016.03.004zbMath1346.05066OpenAlexW2333650839MaRDI QIDQ322063

D. Fitriani, A. N. M. Salman

Publication date: 14 October 2016

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

Full work available at URL: https://doi.org/10.1016/j.akcej.2016.03.004

zbMATH Keywords

fanwheelcomplete graphamalgamationrainbow connection number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Related Items (8)

Rainbow connection number of comb product of graphs ⋮ Rainbow vertex-connection number on a small-world Farey graph ⋮ The strong 3-rainbow index of edge-comb product of a path and a connected graph ⋮ The strong 3-rainbow index of some certain graphs and its amalgamation ⋮ The rainbow 2-connectivity of Cartesian products of 2-connected graphs and paths ⋮ The strong 3-rainbow index of edge-amalgamation of some graphs ⋮ Rainbow 2-connectivity of edge-comb product of a cycle and a Hamiltonian graph ⋮ Color code techniques in rainbow connection

Cites Work

• Rainbow connection of graphs with diameter 2
• Hardness and algorithms for rainbow connection
• Rainbow connections of graphs: a survey
• Rainbow connection in graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Rainbow connection number of amalgamation of some graphs