TOURNAMENTS

作品数:18被引量:5H指数:2
导出分析报告
相关领域:理学文化科学更多>>
相关作者:王普更多>>
相关机构:对外经济贸易大学清华大学更多>>
相关期刊:《Acta Mathematicae Applicatae Sinica》《Chinese Annals of Mathematics,Series B》《Science Bulletin》《Journal of Data and Information Science》更多>>
相关基金:国家自然科学基金山西省自然科学基金更多>>
-

检索结果分析

结果分析中...
选择条件:
  • 期刊=Acta Mathematicae Applicatae Sinicax
条 记 录,以下是1-4
视图:
排序:
On Disjoint Cycles of the Same Length in Tournaments
《Acta Mathematicae Applicatae Sinica》2022年第2期271-281,共11页YUN WANG JIN YAN SHUO ZHU 
supported by the National Natural Science Foundation of China(Nos.12071260,11671232)。
A tournament is an orientation of the complete graph.Tournaments form perhaps the most interesting class of digraphs and it has a great potential for application.Tournaments provide a model of the statistical techniqu...
关键词:TOURNAMENTS minimum out-degree disjoint cycles 
On the Strong n-partite Tournaments with Exactly Two Cycles of Length n-1
《Acta Mathematicae Applicatae Sinica》2018年第4期710-717,共8页Qiao-ping GUO Yu-bao GUO Sheng-jia LI Chun-fang LI 
supported by the Natural Science Young Foundation of China(No.11701349);by the Natural Science Foundation of Shanxi Province,China(No.201601D011005);by Shanxi Scholarship Council of China(2017-018)
Gutin and Rafiey(Australas J. Combin. 34(2006), 17-21) provided an example of an n-partite tournament with exactly n-m + 1 cycles of length of m for any given m with 4 ≤ m ≤ n, and posed the following question....
关键词:nmltipartite tournaments TOURNAMENTS cycles 
A Note on Directed Genera of Some Tournaments
《Acta Mathematicae Applicatae Sinica》2018年第3期478-484,共7页Jian-bing LIU Rong-xia HAO 
Supported by the National Natural Science Foundation of China(No.11731002);the Fundamental Research Funds for the Central Universities(Nos.2016JBM071,2016JBZ012)
An embedding of a digraph in an orientable surface is an embedding as the underlying graph and arcs in each region force a directed cycle. The directed genus is the minimum genus of surfaces in which the digraph can b...
关键词:DIGRAPH directed embedding directed genus surfaces 
Cycles Containing a Given Arc in Regular Multipartite Tournaments被引量:2
《Acta Mathematicae Applicatae Sinica》2002年第4期681-684,共4页Guo-fei Zhou, Ke-min ZhangDepartment of Mathematics, Nanjing University, Nanjing 210093, China 
In this paper we prove that if T is a regular n-partite tournament with n≥>6, then each arc of T lies on a k-cycle for k=4,5,…,n. Our result generalizes theorems due to Alspach and Guo respectively.
关键词:Multitepartite tournaments CYCLE 
检索报告 对象比较 聚类工具 使用帮助 返回顶部