Publicado

2011-07-01

Weak Diameter and Cyclic Properties in Oriented Graphs

Palabras clave:

Weak diameter, 2-Cyclic, Oriented graph (es)

Descargas

Autores/as

  • Daniel Brito Universidad de Oriente
  • Oscar Ordaz Universidad Central de Venezuela
  • María Teresa Varela Universidad Simón Bolívar
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.

Licencia

Derechos de autor 2011 Revista Colombiana de Matemáticas

Creative Commons License

Esta obra está bajo una licencia internacional Creative Commons Atribución 4.0.