A Theorem on Even Pancyclic Bipartite Digraphs
We prove a Meyniel-type condition and a Bang-Jensen, Gutin and Li-type condition for a strongly connected balanced bipartite digraph to be even pancyclic. Let D be a balanced bipartite digraph of order 2a ≥ 6. We prove that (i) If d(x)+d(y) ≥ 3a for every pair of vertices x, y from the same partite...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Gitutyun
2021-12-01
|
| Series: | Mathematical Problems of Computer Science |
| Subjects: | |
| Online Access: | http://mpcs.sci.am/index.php/mpcs/article/view/648 |