Extremal digraphs on Meyniel-type condition for hamiltonian cycles in balanced bipartite digraphs
Let $D$ be a strong balanced digraph on $2a$ vertices. Adamus et al. have proved that $D$ is hamiltonian if $d(u)+d(v)\ge 3a$ whenever $uv\notin A(D)$ and $vu\notin A(D)$. The lower bound $3a$ is tight. In this paper, we shall show that the extremal digraph on this condition is two classes of digrap...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2022-01-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Subjects: | |
| Online Access: | https://dmtcs.episciences.org/5851/pdf |