Weak diameter and cyclic properties in oriented graphs

Thumbnail
Author
Brito, Daniel
Ordaz, Oscar
Varela, María Teresa
Type
Artículo de revista
Document language
Español
Publication Date
2011
Gestores bibliográficos
RIS
Metadata
Show full item record
Cita

Cómo citar

Summary
We describe several conditions on the minimum number of arcs ensuring that any two vertices in a strong oriented graph are joining by a path of length at most a given $k$, or ensuring that they are contained in a common cycle.
Keywords
URI
https://repositorio.unal.edu.co/handle/unal/39456
Collections
Atribución-NoComercial 4.0 InternacionalThis work is licensed under a Creative Commons Reconocimiento-NoComercial 4.0.This document has been deposited by the author (s) under the following certificate of deposit