| 正则c-部竞赛图中过指定顶点数目的路 |
| |
| 引用本文： | 张兢予,李世慧,李杰. 正则c-部竞赛图中过指定顶点数目的路[J]. 太原师范学院学报(自然科学版), 2011, 10(2): 55-56,60 |
| |
| 作者姓名： | 张兢予 李世慧 李杰 |
| |
| 作者单位： | 山西大学数学科学学院,山西太原,030006 |
| |
| 摘 要： | 文章证明了c≥2的正则c-部竞赛图D,V1,V2,…,Vc是D中的部集,如果|V1|=|V2|=…=|Vc|=r≥6,那么D包含一条阶为3c的有向路.进一步,如果r≥9,那么D包含一条来自每一部集至少两个顶点且阶为4c的有向路.更进一步,如果r≥3(n-1),这里n∈N+而且n≥3,那么D中包含一条来自每一部集至少两个顶点且阶为nc的有向路.
|
| 关 键 词： | 竞赛图 正则c-部竞赛图 圈 路 |
Paths with a Given Number of Vertices in Regular c-Partite Tournaments |
| |
| Zhang Jingyu Li Shihui Li Jie. Paths with a Given Number of Vertices in Regular c-Partite Tournaments[J]. Journal of Taiyuan Normal University:Natural Science Edition, 2011, 10(2): 55-56,60 |
| |
| Authors: | Zhang Jingyu Li Shihui Li Jie |
| |
| Affiliation: | Zhang Jingyu Li Shihui Li Jie(School of Mathematical Sciences,Shanxi University,Taiyuan 030006,China) |
| |
| Abstract: | We prove that：For c≥2 we prove that a regular c-partite tournament D with t≥6 vertices in each partite set contains a directed path of order 3c;furthermore,if r≥9,then D contains a directed path with at least two vertices from each partite set of order 4c |
| |
| Keywords: | tournaments regular c-partite tournaments cycle paths |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
