Strong rainbow connection in digraphs

Strong rainbow connection in digraphs

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 co...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Discrete Applied Mathematics 2018-03, Vol.238, p.133-143
Hauptverfasser: Sidorowicz, Elżbieta, Sopena, Éric
Format: Artikel
Sprache:eng
Schlagworte:
Computer Science
Connectors
Digraphs
Discrete Mathematics
Graph theory
Graphs
Shortest-path problems
Strong rainbow connection
Studies
Tournaments
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2017.12.017