The hamiltonicity on the competition graphs of round digraphs

被引：0
|
作者：
ZHANG Xin-hong [1 ]
LI Rui-juan [2 ]
AN Xiao-ting [2 ]
机构：
[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年 / 33卷 / 04期
关键词：
round digraph; competition graph; connected component; hamiltonian;
D O I：
暂无
中图分类号：
O157.5 [图论];
学科分类号：
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;（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.
引用
收藏
页码：409 / 420
页数：12
相关论文
共 50 条
12345