Affiliation:
1. Institute for Informatics and Automation Problems of NAS RA
Abstract
Let D be a 2-strongly connected directed graph of order p ≥ 3. Suppose that d(x) ≥ p for every vertex x ∈ V (D) \ {x0}, where x0 is a vertex of D. In this paper, we show that if D is Hamiltonian or d(x0) > 2(p − 1)/5, then D contains a Hamiltonian path, in which the initial vertex dominates the terminal vertex.
Publisher
Institute for Informatics and Automation Problems - NAS RA
Reference14 articles.
1. J. Bang-Jensen, G. Gutin, Digraphs: Theory, Algorithms and Applications, Springer, 2001.
2. J.-C. Bermond and C. Thomassen, “Cycles in Digraphs-A Survey”, Journal of Graph Theory, vol. 5, pp. 1-43, 1981.
3. D. K¨uhn and D. Osthus, “A survey on Hamilton cycles in directed graphs”, European Journal of Combinatorics, vol. 33, pp. 750-766, 2012.
4. A. Benhocine and A.P. Wojda, “Bypasses in Digraphs”, Ars Combinatoria, vol. 16, pp. 85-94, 1983.
5. A. Benhocine, “On the existence of a specified cycle in digraphs with constraints on degrees”, Journal of Graph Theory, vol. 8, pp. 101-107, 1984.