TY - GEN
A1 - Darbinyan Samvel
A2 - Karapetyan Iskandar
N2 - Let D be a strongly connected balanced bipartite directed graph of order 2a ≥ 10 other than a directed cycle. 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 D contains cycles of all lengths 2, 4, . . . , 2a − 2 or D is isomorphic to a certain digraph of order ten which we specify.
L1 - http://noad.sci.am/Content/135798/DMCA3.pdf
L2 - http://noad.sci.am/Content/135798
T1 - A Sufficient Condition for pre-Hamiltonian Cycles inBipartite Digraphs
UR - http://noad.sci.am/dlibra/docmetadata?id=135798
ER -