Rainbow connection numbers of Cayley graphs
From MaRDI portal
Publication:2410037
DOI10.1007/s10878-016-0052-6zbMath1378.05068OpenAlexW2461936909MaRDI QIDQ2410037
Publication date: 17 October 2017
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-016-0052-6
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)
Related Items (6)
Some results on the total proper \(k\)-connection number ⋮ Some results on the 3-total-rainbow index ⋮ Strong rainbow connection numbers of toroidal meshes ⋮ On the inverse graph of a finite group and its rainbow connection number ⋮ Graphs with (strong) proper connection numbers \(m - 3\) and \(m - 4\) ⋮ Some results on the 3-vertex-rainbow index of a graph
Cites Work
- Unnamed Item
- 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
- The (strong) rainbow connection numbers of Cayley graphs on abelian groups
- Rainbow connection number and connected dominating sets
- Rainbow connection in graphs
- Rainbow Connection in Graphs with Minimum Degree Three
- A group-theoretic model for symmetric interconnection networks
- The rainbow connection of a graph is (at most) reciprocal to its minimum degree
This page was built for publication: Rainbow connection numbers of Cayley graphs