Extremal digraphs on Meyniel-type condition for hamiltonian cycles in balanced bipartite digraphs

Ruixia Wang, Linxin Wu, Wei Meng

Published 2019-10-12Version 1

Adamus et al. have proved that a strong balanced bipartite digraph $D$ on $2a$ vertices is hamiltonian if $d(u)+d(v)\ge 3a$ whenever $uv\notin A(D)$ and $vu\notin A(D)$. The lower bound in the result is tight. In this paper, we shall show that the extremal digraph on this condition is two classes of digraphs that can be clearly characterized.