Rainbow 2-connectivity of edge-comb product of a cycle and a Hamiltonian graph

DOI10.1007/s12044-019-0549-xzbMath1434.05048OpenAlexW3004954661MaRDI QIDQ2303722

Martin Bača, Bety Hayat Susanti, A. N. M. Salman, Rinovia Simanjuntak

Publication date: 4 March 2020

Published in: Proceedings of the Indian Academy of Sciences. Mathematical Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12044-019-0549-x

zbMATH Keywords

cycleHamiltonian graphrainbow pathedge-comb productrainbow 2-connectivity

Mathematics Subject Classification ID

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

Related Items (1)

The strong 3-rainbow index of edge-comb product of a path and a connected graph

Cites Work

• Unnamed Item
• Rainbow connection number of amalgamation of some graphs
• On rainbow-\(k\)-connectivity of random graphs
• Rainbow connection number of graph power and graph products
• Hardness and algorithms for rainbow connection
• On the \(k\)-diameter of \(k\)-regular \(k\)-connected graphs
• Rainbow connections of graphs: a survey
• Rainbow connection and graph products
• Rainbow 2-connection numbers of Cayley graphs
• The rainbow connection number of the power graph of a finite group
• Rainbow connectivity of the non-commuting graph of a finite group
• The rainbow connectivity of a graph
• The rainbow $k$-connectivity of two classes of graphs
• Rainbow connection in graphs
• The rainbow 2-connectivity of Cartesian products of 2-connected graphs and paths

This page was built for publication: Rainbow 2-connectivity of edge-comb product of a cycle and a Hamiltonian graph