¹Universidad de Oriente, Cumaná, Venezuela. Email: britodaniel@cantv.net
²Universidad Central de Venezuela, Caracas, Venezuela. Email: oscarordaz55@gmail.com
³Universidad Simón Bolívar, Caracas, Venezuela. Email: mtvarela@usb.ve

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.

Key words: Weak diameter, 2-Cyclic, Oriented graph.

Damos varias condiciones sobre el número mínimo de arcos que implican la existencia, para todo par de vértices en un digrafo antisimétrico fuertemente conexo de un camino de longitud a lo más un k dado, que los une o de un circuito que los contiene.

Palabras clave: Diamétro débil, 2-ciclíco, digrafo antisimétrico.

Texto completo disponible en PDF

References

[1] J. Bang-Jensen, `Problems and Conjectures Concerning Connectivity, Paths, Trees and Cycles in Tournament-Like Digraphs´, Discrete Mathematics 309, 18 (2009), 5655-5667.         [ Links ]

[2] J. Bang-Jensen and G. Gutin, Digraphs. Theory, Algorithms and Applications, Second edn, Springer Monographs in Mathematics. Springer-Verlag London, Ltd., London, United Kingdom, 2009.         [ Links ]

[3] J. Bang-Jensen, G. Gutin, and A. Yeo, `Hamiltonian Cycles avoiding Prescribed Arcs in Tournaments´, Combin. Probab. Comput. 6, 3 (1997), 255-261.         [ Links ]

[4] J. C. Bermond and B. Bollobás, `The Diameter of Graphs. A survey´, Congressus Numerantium 32, (1981), 3-27.         [ Links ]

[5] J. C. Bermond and C. Thomassen, `Cycles in Digraphs. A Survey´, Journal of Graph Theory 5, (1981), 1-43.         [ Links ]

[6] B. Bollobás and A. Scott, `Separating Systems and Oriented Graphs of Diameter Two´, J. Combinatorial Theory B 97, 2 (2007), 193-203.         [ Links ]

[7] J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, Macmillan, London, United Kingdom, 1976.         [ Links ]

[8] O. Favaron and O. Ordaz, `A Sufficient Condition for Oriented Graphs to be Hamiltonian´, Discrete Math. 58, (1986), 243-252.         [ Links ]

[9] G. Gutin, `Cycles and Paths in Semicomplete Multipartite Digraphs, Theorems and Algorithms. A Survey´, Journal of Graphs 19, (1995), 481-508.         [ Links ]

[10] M. C. Heydemann and D. Sotteau, `About Some Cyclic Properties in Digraphs´, J. Combinatorial Theory B 38, 3 (1985), 261-278.         [ Links ]

[11] C. Thomassen, Long Cycles in Digraphs, `Proc. London Math. Soc.´, (1981), Vol. 3, p. 231-251.         [ Links ]

[12] C. Thomassen, Edge-Disjoint Hamiltonian Paths and Cycles in Tournaments, `Proc. London Math. Soc.´, (1982), Vol. 3, p. 151-168.         [ Links ]

Este artículo se puede citar en LaTeX utilizando la siguiente referencia bibliográfica de BibTeX: