Rainbow connection numbers of Cayley digraphs on abelian groups

DOI10.1016/J.AMC.2017.05.024zbMath1426.05048OpenAlexW2616252371MaRDI QIDQ1739982

Zai Ping Lu, Yingbin Ma

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

zbMATH Keywords

interconnection networksCayley digraphrainbow connection numberbi-Cayley graph

Mathematics Subject Classification ID

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

Related Items (4)

Some results on the total proper \(k\)-connection number ⋮ Some results on the 3-total-rainbow index ⋮ (Strong) proper vertex connection of some digraphs ⋮ Some results on the 3-vertex-rainbow index of a graph

Cites Work

• Unnamed Item
• Rainbow connections for outerplanar graphs with diameter 2 and 3
• Total rainbow \(k\)-connection in graphs
• Rainbow connection number and connectivity
• Rainbow connection in oriented graphs
• Hardness and algorithms for rainbow connection
• Total rainbow connection of digraphs
• Rainbow vertex connection of digraphs
• Rainbow connections of graphs: a survey
• On minimally rainbow \(k\)-connected graphs
• Note on the hardness of rainbow connections for planar and line graphs
• The (strong) rainbow connection numbers of Cayley graphs on abelian groups
• Rainbow connection number and connected dominating sets
• Rainbow connection in graphs
• 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 digraphs on abelian groups