太原理工大学学报2017，Vol.48Issue(6)：1029-1032,4.DOI:10.16355/j.cnki.issn1007-9432tyut.2017.06.027
组合竞赛图的控制图
Domination Graph of a Combined Tournament
摘要
Abstract
A tournament is a directed graph (digraph)obtained by assigning a direction for each edge in an undirected complete graph.There is a close relationship between domination graph and competition graph of tournaments.The exploration of domination graphs has played an important role in biology research of species competition graph.Given a tournament T with c ver-tices and tournaments S i ,i =1,2,…,c .Let D =T [S 1 ,S 2 ,…,S c ]denote the combined tourna-ment of T .In this paper,we focus on the properties and structure of domination graph of com-bined tournaments.Based on current results,we present an efficient algorithm for the domination graph of a combined tournament.关键词
竞赛图/组合竞赛图/控制图Key words
tournament/combined tournament/domination graph分类
数理科学引用本文复制引用
张云霞,杨卫华..组合竞赛图的控制图[J].太原理工大学学报,2017,48(6):1029-1032,4.基金项目
国家自然科学基金资助项目(11671296) （11671296）
