The hamiltonicity on the competition graphs of round digraphs

被引：0
|
作者：
Zhang, Xin-hong [1 ]
Li, Rui-juan [2 ]
An, Xiao-ting [2 ]
机构：
[1] Taiyuan Univ Sci & Technol, Dept Appl Math, Taiyuan 030024, Shanxi, Peoples R China
[2] Shanxi Univ, Sch Math Sci, Taiyuan 030006, Shanxi, Peoples R China
来源：
APPLIED MATHEMATICS-A JOURNAL OF CHINESE UNIVERSITIES SERIES B | 2018年 / 33卷 / 04期
关键词：
round digraph; competition graph; connected component; hamiltonian;
D O I：
10.1007/s11766-018-3494-z
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
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) 60. In this paper, we investigate the competition graphs of round digraphs and give a necessary and suffcient condition for these graphs to be hamiltonian.
引用
收藏
页码：409 / 420
页数：12
相关论文
共 50 条
12345