中北大学学报（自然科学版）2017，Vol.38Issue(3)：264-268,5.DOI:10.3969/j.issn.1673-3193.2017.03.003
二部竞赛图的竞争图与(1,2)步竞争图的边集关系
Relation of the Edge Sets Between the Competition Graph and the (1,2)-step Competition Graph of a Bipartite Tournament
摘要
Abstract
The edge sets between the competition graph and the (1,2)-step competition graph of a bipartite tournament were investigated comparatively.From the structure of a bipartite tournament, the edges inside each partite set of the two graphs are the same and the difference of edges is between the two partite sets.By analysing the edges between two partite sets of (1,2)-step competition graph, the lower bound ε1,2min(m,n) and the upper bound ε1,2max(m,n) of the difference of the edges'numbers of the two graphs were obtained.And some examples were given to show the sharpness of the bounds.关键词
二部竞赛图/竞争图/(1,2)步竞争图Key words
bipartite tournament/competition graph/(1/2)-step competition graph分类
数理科学引用本文复制引用
李瑞娟,安晓婷..二部竞赛图的竞争图与(1,2)步竞争图的边集关系[J].中北大学学报（自然科学版）,2017,38(3):264-268,5.基金项目
国家自然科学基金资助项目(11401353) （11401353）
山西省回国留学人员科研资助项目(2013-017) （2013-017）
