Rainbow connection numbers of Cayley digraphs on abelian groups

Yingbin Ma and Zaiping Lu

Applied Mathematics and Computation, 2017, vol. 311, issue C, 178-183

Abstract: A directed path in an edge colored digraph is said to be a rainbow path if no two edges on this path share the same color. An edge colored digraph Γ is rainbow connected if any two distinct vertices can be reachable from each other through rainbow paths. The rc-number of a digraph Γ is the smallest number of colors that are needed in order to make Γ rainbow connected. In this paper, we investigate the rc-numbers of Cayley digraphs on abelian groups and present an upper bound for such digraphs. In addition, we consider the rc-numbers of bi-Cayley graphs on abelian groups.

Keywords: Rainbow connection number; Cayley digraph; bi-Cayley graph; Interconnection networks (search for similar items in EconPapers)
Date: 2017
References: View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300317303223
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:311:y:2017:i:c:p:178-183

DOI: 10.1016/j.amc.2017.05.024

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().