A Degree Sum Condition for Hamiltonicity in Balanced Bipartite Digraphs

详细信息    查看全文

• 作者：Janusz Adamus
• 关键词：Digraph ; Bipartite digraph ; Cycle ; Hamiltonicity ; Degree condition
• 刊名：Graphs and Combinatorics
• 出版年：2017
• 出版时间：January 2017
• 年：2017
• 卷：33
• 期：1
• 页码：43-51
• 全文大小：
• 刊物类别：Mathematics and Statistics
• 刊物主题：Combinatorics; Engineering Design;
• 出版者：Springer Japan
• ISSN：1435-5914
• 卷排序：33

文摘

We prove that a strongly connected balanced bipartite digraph D of order 2a is hamiltonian, provided \(a\ge 3\) and \(d(x)+d(y)\ge 3a\) for every pair of vertices x, y with a common in-neighbour or a common out-neighbour in D.