| 正则多部竞赛图中过任意点的强子竞赛图 |
| |
| 引用本文： | 徐高奎,李胜家. 正则多部竞赛图中过任意点的强子竞赛图[J]. 数学的实践与认识, 2010, 40(22) |
| |
| 作者姓名： | 徐高奎 李胜家 |
| |
| 摘 要： | 对正则多部竞赛图中的强子竞赛图进行了研究,证明了正则c(c≥6)部竞赛图中每点都在顶点数为{3,4,…,c-3}的强子竞赛图中.
|
| 关 键 词： | 正则图 多部竞赛图 顶点泛圈图 |
Strong Subtournaments Containing Arbitrary Vertex in Regular Multipartite Tournaments |
| |
| XU Gao-kui,LI Sheng-jia. Strong Subtournaments Containing Arbitrary Vertex in Regular Multipartite Tournaments[J]. Mathematics in Practice and Theory, 2010, 40(22) |
| |
| Authors: | XU Gao-kui LI Sheng-jia |
| |
| Abstract: | In this paper,we study the strong subtournaments in regular multipartite tournaments and prove that each vertex of a regular multipartite tournament with c≥6 partite sets is contained in a strong subtournament of order p for every p∈{3,4,…,c- 3}. |
| |
| Keywords: | regular digraph multipartite tournament vertex-pancyclic digraph |
| 本文献已被 万方数据 等数据库收录！ |
|
