强连通多部竞赛图中顶点和弧的外路  

Outpaths of Vertices and Arcs in Strong Multipartite Tournaments

作　　者：郭巧萍[1] GUO Qiaoping(School of Mathematical Sciences,Shanxi University,Taiyuan 030006,China)

机构地区：[1]山西大学数学科学学院,山西太原030006

出　　处：《山西大学学报（自然科学版）》2023年第1期126-130,共5页Journal of Shanxi University(Natural Science Edition)

基　　金：山西省优秀青年基金(201901D211197);山西省自然科学基金(20210302124019)。

摘　　要：为了在强连通多部竞赛图中寻找顶点和弧的外路,采用对原图去顶点或去弧的方法。通过在新得到的有向图中寻找哈密尔顿圈,进而找到顶点和弧的外路。研究结果表明强连通多部竞赛图中顶点和弧泛外路的两个充分条件被获得。In order to find outpaths of vertices and arcs in strong multipartite tournaments, the method of removing vertices or arcs from the original graph was adopted. By looking for Hamilton cycle in the newly obtained digraph, outpaths of vertices and arcs were further found. The results show that two sufficient conditions for outpaths of vertices and arcs in strong multipartite tournaments to be pancyclic are obtained.

关 键 词：外路 强连通多部竞赛图 几乎正则多部竞赛图 

分 类 号：O157.5[理学—数学]