Strong rainbow connection numbers of toroidal meshes

DOI10.1142/S1793830918500398zbMath1400.05116arXiv1702.07986MaRDI QIDQ4554570

Kaishun Wang, Min Xu, Yu-Long Wei

Publication date: 14 November 2018

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

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

zbMATH Keywords

Cayley graphtoroidal meshstrong rainbow connection numberstrong rainbow path

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15)

Related Items

The weakly dimension-balanced pancyclicity on toroidal mesh graph \(T_{m,n}\) When both \(m\) and \(n\) are odd

Cites Work

• Unnamed Item
• Polynomial algorithm for sharp upper bound of rainbow connection number of maximal outerplanar graphs
• Upper bounds for the rainbow connection numbers of line graphs
• Rainbow connections of graphs: a survey
• Rainbow connection numbers of Cayley graphs
• The (strong) rainbow connection numbers of Cayley graphs on abelian groups
• The rainbow connection number of the power graph of a finite group
• Rainbow connectivity of the non-commuting graph of a finite group
• New Hardness Results in Rainbow Connectivity
• Rainbow Connection Numbers for Undirected Double-Loop Networks
• Rainbow connection in graphs