Title:
A Sufficient Condition for pre-Hamiltonian Cycles inBipartite Digraphs
Author:
Type:
Co-author(s) :
Uncontrolled Keywords:
Digraphs ; pre-Hamiltonian cycles ; bipartite balanced digraphs ; even pancyclic
Abstract:
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.
Language:
URL:
Affiliation:
Institute for Informatics and Automation Problems
Country:
Year:
Time period:
Conference title:
11th International Conference on Computer Science and Information Technologies CSIT 2017