Strong rainbow connection in digraphs
Strong rainbow connection in digraphs
复制标题
DOI：
10.1016/j.dam.2017.12.017
复制
发表时间：
2018-03
期刊：
影响因子：
--
通讯作者：
E. Sidorowicz;É. Sopena
中科院分区：
文献类型：
--
作者：
E. Sidorowicz;É. Sopena
一个弧色有向图是强彩虹连通的，如果对于每对顶点（u，v），存在一条从u到v的最短路，且这条路的弧都是不同颜色的.一个有向图的强彩虹连通数是使图强彩虹连通所需的最小颜色数。本文研究了极小强连通有向图、非Hamilton强有向图和强竞赛图的强彩虹联系数。
An arc-coloured digraph is strongly rainbow connected if for every pair of vertices (u, v) there exists a shortest path from u to v all of whose arcs have different colours. The strong rainbow connection number of a digraph is the minimum number of colours needed to make the graph strongly rainbow connected. In this paper, we study the strong rainbow connection number of minimally strongly connected digraphs, non-Hamiltonian strong digraphs and strong tournaments.