Object
Title: A Sufficient Condition for pre-Hamiltonian Cycles inBipartite Digraphs
Co-author(s) :
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.
Identifier:
oai:noad.sci.am:135798
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
Place:
Participation type:
Object collections:
- Digital Library > Academic Insitutions > Insitute for Informatics and Automation Problems of NAS RA > Conferences
Last modified:
Mar 3, 2021
In our library since:
Jul 16, 2020
Number of object content hits:
42
All available object's versions:
https://noad.sci.am/publication/149325
Show description in RDF format:
Show description in OAI-PMH format:
| Edition name | Date |
|---|---|
| Samvel Kh. Darbinyan, A Sufficient Condition for pre-Hamiltonian Cycles inBipartite Digraphs | Mar 3, 2021 |
