English

A degree sum condition for hamiltonicity in balanced bipartite digraphs

Combinatorics 2015-12-03 v1

Abstract

We prove that a strongly connected balanced bipartite digraph DD of order 2a2a is hamiltonian, provided a3a\geq3 and d(x)+d(y)3ad(x)+d(y)\geq 3a for every pair of vertices xx, yy with a common in-neighbour or a common out-neighbour in DD.

Keywords

Cite

@article{arxiv.1512.00480,
  title  = {A degree sum condition for hamiltonicity in balanced bipartite digraphs},
  author = {Janusz Adamus},
  journal= {arXiv preprint arXiv:1512.00480},
  year   = {2015}
}

Comments

9 pages. arXiv admin note: text overlap with arXiv:1506.07949 by other authors

R2 v1 2026-06-22T11:59:04.313Z