Object
Title: Sufficient conditions for a balanced bipartite digraph to be even pancyclic
Abstract:
Let D be a strongly connected balanced bipartite directed graph of order 2a≥8. In this note we prove: (i). If D contains a cycle of length 2a−2≥6 and max{d(x),d(y)}≥2a−2 for every pair of vertices {x,y}with a common out-neighbour, then for every k, 1≤k≤a−1, D contains a cycle of length 2k. (ii). If D is not a directed cycle and max{d(x),d(y)}≥2a−1 for every pair of vertices {x,y} with a common out-neighbour, then for every k, 1≤k≤a, D contains a cycle of length 2k unless D is isomorphic to a certain digraph of order eight which we specify.
Publisher:
Date submitted:
Date accepted:
Date of publication:
Identifier:
oai:noad.sci.am:136143
DOI:
ISSN:
Language:
Journal or Publication Title:
Volume:
URL:
Additional Information:
Affiliation:
Institute for Informatics and Automation Problems
Country:
Indexing:
Object collections:
- Digital Library > Academic Insitutions > Insitute for Informatics and Automation Problems of NAS RA > Publications
Last modified:
Apr 19, 2021
In our library since:
Apr 19, 2021
Number of object content hits:
27
All available object's versions:
https://noad.sci.am/publication/149555
Show description in RDF format:
Show description in OAI-PMH format:
| Edition name | Date |
|---|---|
| Samvel Kh.Darbinyan, Sufficient conditions for a balanced bipartite digraph to be even pancyclic | Apr 19, 2021 |
