Journal of Systems Engineering and Electronics ›› 2009, Vol. 31 ›› Issue (10): 2513-2515.

• 软件、算法与仿真 • 上一篇    下一篇

局部几乎正则多部竞赛图中的分量共轭圈

何志红1,2, 李国君3, 李曙光4   

  1. 1. 山东大学计算机科学与技术学院, 山东, 济南, 250101;
    2. 烟台大学教学与信息科学学院, 山东, 烟台, 264005;
    3. 山东大学数学与系统科学学院, 山东, 济南, 250100;
    4. 山东工商学院信息与电子工程学院, 山东, 烟台, 264005
  • 收稿日期:2008-04-04 修回日期:2008-09-13 出版日期:2009-10-20 发布日期:2010-01-03
  • 作者简介:何志红(1978- ),女,博士研究生,主要研究方向为图论与组合最优化.E-mail:zhihhe@126.com
  • 基金资助:
    国家自然科学基金(60373025)资助课题

Componentwise complementary cycles in locally almost regular multipartite tournaments

HE Zhi-hong1,2, LI Guo-jun3, LI Shu-guang4   

  1. 1. School of Computer Science and Technology, Shandong Univ., Jinan 250101, China;
    2. School of Mathematics and Information Sciences, Yantai Univ., Yantai 264005, China;
    3. School of Mathematics and System Sciences, Shandong Univ., Jinan 250100, China;
    4. Schooll of Information and Electronics Engineering, Shandong Inst. of Businessand Technology, Yantai264005, China
  • Received:2008-04-04 Revised:2008-09-13 Online:2009-10-20 Published:2010-01-03

摘要: 一个n-部竞赛图是n-部完全图的一个定向.令V1,V2,…,Vnn-部有向图D的部集.如果D中存在两个不相交的圈CC'使得对于每一个i∈{1,2,…,n}都有Vi(V(C)∪V(C'))≠ƒ,则称CC'是D的一对分量共轭圈.针对多部竞赛图的共轭圈问题,提出了分量共轭圈的定义,同时证明了每一个至少有6个顶点的部集具有相等基数的局部几乎正则多部竞赛图的分量共轭圈的存在性问题.

Abstract: An n-partite tournament is an orientation of a complete n-partite graph.Let V1,V2,…,Vn be the partite sets of D.If there exist two vertex disjoint outpaths C and C' in D such that Vi(V(C)∪V(C'))≠ƒ for all i∈{1,2,…,n},then C and C' are a pair of componentwise complementary outpaths of D.For the complementary cycles problems of multipartite tournaments presents the definition of componentwise complementary cycles,proves the existing problem of componentwise complementary cycles of locally almost regular multipartite tournaments that has at least six vertices and the same partite sets cardinality.

中图分类号: