The (strong) rainbow connection numbers of Cayley graphs on abelian groups

DOI10.1016/j.camwa.2011.09.056zbMath1235.05063arXiv1011.0827OpenAlexW2150490129MaRDI QIDQ2429053

Hengzhe Li, Sujuan Liu, Xue Liang Li

Publication date: 22 April 2012

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

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

zbMATH Keywords

Cayley graphedge-coloringabelian grouprainbow pathrecursive circulant(strong) rainbow connection number

Mathematics Subject Classification ID

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

Related Items (10)

The rainbow connection number of the power graph of a finite group ⋮ Strong rainbow connection numbers of toroidal meshes ⋮ Rainbow connection numbers of Cayley graphs ⋮ Rainbow connections of graphs: a survey ⋮ On the inverse graph of a finite group and its rainbow connection number ⋮ The \(k\)-proper index of graphs ⋮ Rainbow connection numbers of Cayley digraphs on abelian groups ⋮ On various (strong) rainbow connection numbers of graphs ⋮ Rainbow 2-connection numbers of Cayley graphs ⋮ Rainbow connectivity of the non-commuting graph of a finite group

Cites Work

• Unnamed Item
• Extraconnectivity of hypercubes
• Recursive circulants and their embeddings among hypercubes
• Embedding trees in recursive circulants
• The rainbow connectivity of a graph
• Rainbow connection in graphs
• The rainbow connection of a graph is (at most) reciprocal to its minimum degree

This page was built for publication: The (strong) rainbow connection numbers of Cayley graphs on abelian groups