Hamilton-connectivity of 3-domination-critical graphs with alpha <=delta

doi:10.1016/S0012-365X(02)00876-2

CSpace

	Hamilton-connectivity of 3-domination-critical graphs with alpha <=delta
	Chen, YJ ; Tian, F ; Wei, B
	2003-09-28
发表期刊	DISCRETE MATHEMATICS
ISSN	0012-365X
卷号	271 期号:1-3 页码:1-12
摘要	A graph G is 3-domination critical if its domination number gamma is 3 and the addition of any edge decreases gamma by 1. Let G be a 3-connected 3-domination critical graph with alpha(G) less than or equal to delta(G). In this paper, we show that G is Hamilton-connected if and only if tau(G) > 1, where tau(G) is the toughness of G. (C) 2003 Elsevier B.V. All rights reserved.
关键词	domination-critical graph Hamilton-connectivity
DOI	10.1016/S0012-365X(02)00876-2
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics
WOS记录号	WOS:000185241100001
出版者	ELSEVIER SCIENCE BV
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/18912
专题	中国科学院数学与系统科学研究院
通讯作者	Chen, YJ
作者单位	1.Nanjing Univ, Dept Math, Nanjing 210093, Peoples R China 2.Chinese Acad Sci, Inst Syst Sci, Acad Math & Syst Sci, Beijing 100080, Peoples R China
推荐引用方式 GB/T 7714	Chen, YJ,Tian, F,Wei, B. Hamilton-connectivity of 3-domination-critical graphs with alpha <=delta[J]. DISCRETE MATHEMATICS,2003,271(1-3):1-12.
APA	Chen, YJ,Tian, F,&Wei, B.(2003).Hamilton-connectivity of 3-domination-critical graphs with alpha <=delta.DISCRETE MATHEMATICS,271(1-3),1-12.
MLA	Chen, YJ,et al."Hamilton-connectivity of 3-domination-critical graphs with alpha <=delta".DISCRETE MATHEMATICS 271.1-3(2003):1-12.