Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
5775727 | Applied Mathematics and Computation | 2017 | 6 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Yingbin Ma, Zaiping Lu,