6 research outputs found
Extremal digraphs on Meyniel-type condition for hamiltonian cycles in balanced bipartite digraphs
Let be a strong balanced digraph on vertices. Adamus et al. have
proved that is hamiltonian if whenever
and . The lower bound 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. Moreover, we also show that if
whenever and , then is
traceable. The lower bound is tight.Comment: 16 page