Weak diameter and cyclic properties in oriented graphs

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.

Autores:
Brito, Daniel
Ordaz, Oscar
Varela, María Teresa
Tipo de recurso:
Article of journal
Fecha de publicación:
2011
Institución:
Universidad Nacional de Colombia
Repositorio:
Universidad Nacional de Colombia
Idioma:
spa
OAI Identifier:
oai:repositorio.unal.edu.co:unal/39456
Acceso en línea:
https://repositorio.unal.edu.co/handle/unal/39456
http://bdigital.unal.edu.co/29553/
Palabra clave:
Weak diameter
2-Cyclic
Oriented graph
05B10
11B13
Rights
openAccess
License
Atribución-NoComercial 4.0 Internacional