Neighborhood unions and cyclability of graphs

doi:10.1016/j.dam.2003.05.002

CSpace

	Neighborhood unions and cyclability of graphs
	Liu, HQ ; Lu, M ; Tian, F
	2004-05-15
发表期刊	DISCRETE APPLIED MATHEMATICS
ISSN	0166-218X
卷号	140 期号:1-3 页码:91-101
摘要	A graph G is said to be cyclable if for each orientation (G) over right arrow of G, there exists a set S of vertices such that reversing all the arcs of (G) over right arrow with one end in S results in a hamiltonian digraph. Let G be a 3-connected graph of order n greater than or equal to 36. In this paper, we show that if for any three independent vertices x(1), x(2) and x(3), \N(x(1)) boolean OR N(x(2))\ + \N(x(2)) boolean OR N(x(3))\ + \N(x(3)) boolean OR N(x(1))\ greater than or equal to, 2n + 1, then G is cyclable. (C) 2003 Elsevier B.V. All rights reserved.
关键词	Hamiltonian cycle pushed operation cyclable graph digraph
DOI	10.1016/j.dam.2003.05.002
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics, Applied
WOS记录号	WOS:000222185700006
出版者	ELSEVIER SCIENCE BV
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/19550
专题	中国科学院数学与系统科学研究院
通讯作者	Liu, HQ
作者单位	1.Chinese Acad Sci, Acad Math & Syst Sci, Inst Syst Sci, Beijing 10080, Peoples R China 2.Tsing Hua Univ, Dept Mat Sci, Beijing 10084, Peoples R China
推荐引用方式 GB/T 7714	Liu, HQ,Lu, M,Tian, F. Neighborhood unions and cyclability of graphs[J]. DISCRETE APPLIED MATHEMATICS,2004,140(1-3):91-101.
APA	Liu, HQ,Lu, M,&Tian, F.(2004).Neighborhood unions and cyclability of graphs.DISCRETE APPLIED MATHEMATICS,140(1-3),91-101.
MLA	Liu, HQ,et al."Neighborhood unions and cyclability of graphs".DISCRETE APPLIED MATHEMATICS 140.1-3(2004):91-101.