首页 | 本学科首页   官方微博 | 高级检索  
     检索      

k-强竞赛图中外弧泛5顶点的数目
引用本文:郭巧萍,李胜家.k-强竞赛图中外弧泛5顶点的数目[J].数学的实践与认识,2010(3).
作者姓名:郭巧萍  李胜家
作者单位:山西大学数学科学学院;山西大学数学与应用数学研究所;
基金项目:山西省自然科学基金(200701■02)
摘    要:称具有n≥3个顶点的强竞赛图T中的一条弧是泛k的,如果对所有的k≤l≤n来说,它属于每个l-圈.本文证明了每个s-强(s≥4)竞赛图至少包含s+2个顶点使得它们的所有外弧都是泛5的.

关 键 词:竞赛图    外弧

The Number of Vertices Whose Out-Arcs Are 5-Pancyclic in K-Strong Tournaments
GUO Qiao-ping,LI Sheng-jia.The Number of Vertices Whose Out-Arcs Are 5-Pancyclic in K-Strong Tournaments[J].Mathematics in Practice and Theory,2010(3).
Authors:GUO Qiao-ping  LI Sheng-jia
Institution:GUO Qiao-ping~(1,2),LI Sheng-jia~2 (1.School of Mathematical Sciences,Shanxi University,Taiyuan 030006,China) (2.Institute of Mathematics , Applied Mathematics,China)
Abstract:An arc in a tournament T with n≥3 vertices is called k-pancyclic,if it belongs to a cycle of length l for all k≤l≤n.In this paper,the result that each s-strong tournament with s≥4 contains at least s + 2 vertices whose out-arcs are 4-pancyclic is obtained.
Keywords:tournaments  cycles  out-arcs  
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号