摘要
研究了有向图的两个方面:竞赛图的Hamilton-路数的计数及有关竞赛排名的相关问题,多部或n-部竞赛图是完全n-部图的一个定向。根据Bongdy的强连通n-部竞赛图包含一个m-圈,其中m∈{3,4,…,n},Yeo的正则多部竞赛图是Hamilton图的原理,笔者在上述结论基础上,得到某些特殊的多部竞赛图的Hamilton路数的一些结论。
This paper deals with two aspects of directed graphs： the number of Hamilton-path and the problem of the competition taxis. A multipartite or n-partite tournament is an orientation of a complete n-partite graph. In 1976, Bondy proved that a strong n-partite tournament contains an m-cycle, for every rn E { 3, 4,…, n }. Yeo showed that regular multipartite tournament is Hamiltonian. To the research of directed graphs, many references consider mainly the existence of Hamilton-path for directed graphs, but few consider the number of Hamilton-path. This thesis applies the above results and obtains some theorems about some special n-partite tournament.
出处
《太原理工大学学报》
CAS
北大核心
2009年第1期88-90,共3页
Journal of Taiyuan University of Technology
关键词
多部竞赛图
哈密尔顿圈
哈密尔顿路
regular maltipartite tournament
hamiltonian cycle
hamilton-path
作者简介
范庆民（1954--），女，河南修武人，副教授，主要从事图论及矩阵理论研究，（E-mail）tyutfanqingmin07@yahoo．com．cn
