Rainbow connection numbers of Cayley digraphs on abelian groups
From MaRDI portal
(Redirected from Publication:1739982)
Recommendations
Cites work
- A group-theoretic model for symmetric interconnection networks
- Graph theory
- Hardness and algorithms for rainbow connection
- Note on the hardness of rainbow connections for planar and line graphs
- On minimally rainbow \(k\)-connected graphs
- Rainbow connection in graphs
- Rainbow connection in oriented graphs
- Rainbow connection number and connected dominating sets
- Rainbow connection number and connectivity
- Rainbow connections for outerplanar graphs with diameter 2 and 3
- Rainbow vertex connection of digraphs
- The (strong) rainbow connection numbers of Cayley graphs on abelian groups
- The rainbow connection of a graph is (at most) reciprocal to its minimum degree
- Total rainbow \(k\)-connection in graphs
- Total rainbow connection of digraphs
Cited in
(8)- Rainbow connection numbers of Cayley graphs
- The rainbow connection number of the power graph of a finite group
- The (strong) rainbow connection numbers of Cayley graphs on abelian groups
- (Strong) proper vertex connection of some digraphs
- Some results on the total proper \(k\)-connection number
- Some results on the 3-total-rainbow index
- Rainbow 2-connection numbers of Cayley graphs
- Some results on the 3-vertex-rainbow index of a graph
This page was built for publication: Rainbow connection numbers of Cayley digraphs on abelian groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1739982)