Rainbow connection numbers of Cayley digraphs on abelian groups
From MaRDI portal
Publication:1739982
DOI10.1016/J.AMC.2017.05.024zbMATH Open1426.05048OpenAlexW2616252371MaRDI QIDQ1739982FDOQ1739982
Authors: Yingbin Ma, Zai Ping Lu 
Publication date: 29 April 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2017.05.024
Recommendations
Coloring of graphs and hypergraphs (05C15) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Connectivity (05C40)
Cites Work
- Graph theory
- Note on the hardness of rainbow connections for planar and line graphs
- Rainbow connection number and connected dominating sets
- Rainbow connection in graphs
- A group-theoretic model for symmetric interconnection networks
- Hardness and algorithms for rainbow connection
- The rainbow connection of a graph is (at most) reciprocal to its minimum degree
- Rainbow connections for outerplanar graphs with diameter 2 and 3
- Total rainbow \(k\)-connection in graphs
- On minimally rainbow \(k\)-connected graphs
- Rainbow connection number and connectivity
- Rainbow connection in oriented graphs
- Rainbow vertex connection of digraphs
- Total rainbow connection of digraphs
- The (strong) rainbow connection numbers of Cayley graphs on abelian groups
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)
