Let D be a strongly connected balanced bipartite directed graph of order 2a ≥ 10. Let x, y be distinct vertices in D. {x,y} dominates a vertex z if x → z and y → z; in this case, we call the pair {x,y} dominating. In this paper we prove: If max{d(x); d(y)} ≥ 2a-2 for every dominating pair of vertices {x,y} then either the underlying graph of D is 2-connected or D contains a cycle of length 2a - 2 or D is isomorphic to one digraph of order ten.
oai:arar.sci.am:258884
ՀՀ ԳԱԱ Հիմնարար գիտական գրադարան
Dec 8, 2023
Jul 24, 2020
16
https://arar.sci.am/publication/282013
Edition name | Date |
---|---|
On pre-Hamiltonian Cycles in Balanced Bipartite Digraphs | Dec 8, 2023 |
Samvel Kh. Darbinyan Iskandar A. Karapetyan
Samvel Kh. Darbinyan Iskandar A. Karapetyan
Samvel Kh. Darbinyan Iskandar A. Karapetyan