Extremal digraphs on Meyniel-type condition for hamiltonian cycles in balanced bipartite digraphs
Work
Year: 2022
Type: article
Abstract: 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 tigh... more
Authors Ruixia Wang, Linxin Wu, Meng Wei
Institution Shanxi University
Cites: 15
Cited by: 3
Related to: 10
FWCI: 0.361
Citation percentile (by year/subfield): 35.2
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond