The hamiltonicity on the competition graphs of round digraphs  

作　　者：ZHANG Xin-hong LI Rui-juan AN Xiao-ting 

机构地区：[1]Department of Applied Mathematics, Taiyuan University of Science and Technology [2]School of Mathematical Sciences, Shanxi University

出　　处：《Applied Mathematics(A Journal of Chinese Universities)》2018年第4期409-420,共12页高校应用数学学报（英文版）（B辑）

基　　金：Supported by NSFC(11401353);TYAL of Shanxi;Natural Science Foundation of Shanxi Province(2016011005)

摘　　要：Given a digraph D =（V, A）, the competition graph G of D, denoted by C（D）, has the same set of vertices as D and an edge between vertices x and y if and only if N;（x）∩N;（y）≠Ф. In this paper, we investigate the competition graphs of round digraphs and give a necessary and sufficient condition for these graphs to be hamiltonian.Given a digraph D =(V, A), the competition graph G of D, denoted by C(D), has the same set of vertices as D and an edge between vertices x and y if and only if N_D^+(x)∩N_D^+(y)≠Ф. In this paper, we investigate the competition graphs of round digraphs and give a necessary and sufficient condition for these graphs to be hamiltonian.

关 键 词：round digraph competition graph connected component HAMILTONIAN 

分 类 号：O1[理学—数学]