山西大学学报（自然科学版）2007，Vol.30Issue(2)：143-148,6.
Hamilton有向图的一个新的充分条件
A New Sufficient Condition for Hamiltonian Digraphs
摘要
Abstract
Let D be a strongly connected digraph of order n≥2. It has been conjectured that if d(x)+d(y)≥2n-1 for every pair of non-adjacent vertices x,y with a common out-neighbor or a common in-neighbor. then D is hamiltonian. In this paper.it is proved that for a digraph D of order n≥7,if d(x)+d(y)≥5n/2-5 for every pair of non-adjacent vertices x,y with a common out-neighbor or a common in-neighbor,then D is hamiltonian and for 3≤ n≤6,there are non-hamiltonian digraphs satisfying that d(x) +d(y)≥5n/2-5 for every pair of non-adjacent vertices x,y with a common out-neighbor or a common in-neighbor.关键词
有向图/Hamilton图/Hamilton有向图Key words
digraphs/hamiltonian cycles/hamiltonian digraphs分类
数理科学引用本文复制引用
王世英,原军,刘爱霞..Hamilton有向图的一个新的充分条件[J].山西大学学报（自然科学版）,2007,30(2):143-148,6.基金项目
The National Natural Science Foundation of China(10471081) （10471081）
