Rainbow vertex connection of digraphs

Hui Lei (), Shasha Li (), Henry Liu () and Yongtang Shi ()
Additional contact information
Hui Lei: Nankai University
Shasha Li: Zhejiang University
Henry Liu: Central South University
Yongtang Shi: Nankai University

Journal of Combinatorial Optimization, 2018, vol. 35, issue 1, No 8, 86-107

Abstract: Abstract An edge-coloured path is rainbow if its edges have distinct colours. An edge-coloured connected graph is said to be rainbow connected if any two vertices are connected by a rainbow path, and strongly rainbow connected if any two vertices are connected by a rainbow geodesic. The (strong) rainbow connection number of a connected graph is the minimum number of colours needed to make the graph (strongly) rainbow connected. These two graph parameters were introduced by Chartrand et al. (Math Bohem 133:85–98, 2008). As an extension, Krivelevich and Yuster proposed the concept of rainbow vertex-connection. The topic of rainbow connection in graphs drew much attention and various similar parameters were introduced, mostly dealing with undirected graphs. Dorbec, Schiermeyer, Sidorowicz and Sopena extended the concept of the rainbow connection to digraphs. In this paper, we consider the (strong) rainbow vertex-connection number of digraphs. Results on the (strong) rainbow vertex-connection number of biorientations of graphs, cycle digraphs, circulant digraphs and tournaments are presented.

Keywords: Rainbow connection; Rainbow vertex-connection; Digraphs; Tournaments (search for similar items in EconPapers)
Date: 2018
References: View complete reference list from CitEc
Citations: View citations in EconPapers (9)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-017-0156-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

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:spr:jcomop:v:35:y:2018:i:1:d:10.1007_s10878-017-0156-7

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-017-0156-7

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().