摘要
证明了命题“竞赛图D =(V ,E) ,顶点的个数 V =n为奇数 ,对 v∈V ,d+(v) =d-(v) =n - 12 竞赛图是哈密顿图。
In the paper,we prove that Tournament D *=(V,E) vertices number V=n is odd, v∈V,d + (v) =d - (v) =n-12 . Then Tournament D *=(V,E) is Hamiltonian graph.
出处
《贵州大学学报（自然科学版）》
2004年第2期124-126,共3页
Journal of Guizhou University:Natural Sciences
关键词
竞赛图
双向(强)连通图
哈密顿图
Tournament
Diconnected digraph (strongly connected directed digraph)
Hamiltonian graph
