A degree sum condition for hamiltonicity in balanced bipartite digraphs

preprint2015arXivOpen access

Abstract

We prove that a strongly connected balanced bipartite digraph DD of order 2a2a is hamiltonian, provided a≥3a\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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.