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

doi:10.1006/eujc.2002.0603

CSpace

	Hamilton-connectivity of 3-domination critical graphs with alpha=delta+2
	Chen, YJ ; Tian, F ; Zhang, YQ
	2002-10-01
发表期刊	EUROPEAN JOURNAL OF COMBINATORICS
ISSN	0195-6698
卷号	23 期号:7 页码:777-784
摘要	A graph G is 3-domination critical if its domination number gamma is 3 and the addition of any edge decreases gamma by 1. It was proved by Favaron et al. that alpha less than or equal to delta + 2 for any connected 3-domination critical graph. Denote by tau (G) the toughness of a graph G. Recently Chen et al. conjectured that a connected 3-domination critical graph G is Hamilton-connected if and only if tau (G) > l and showed the conjecture is true when alpha less than or equal to delta. In this paper, by using a closure operation defined by Bondy and Chvatal, we show the conjecture is true when alpha = delta + 2. (C) 2002 Elsevier Science Ltd. All rights reserved.
DOI	10.1006/eujc.2002.0603
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics
WOS记录号	WOS:000178352800003
出版者	ACADEMIC PRESS LTD ELSEVIER SCIENCE LTD
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/17011
专题	中国科学院数学与系统科学研究院
通讯作者	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 3.Shaanxi Normal Univ, Dept Math, Xian 710062, Peoples R China
推荐引用方式 GB/T 7714	Chen, YJ,Tian, F,Zhang, YQ. Hamilton-connectivity of 3-domination critical graphs with alpha=delta+2[J]. EUROPEAN JOURNAL OF COMBINATORICS,2002,23(7):777-784.
APA	Chen, YJ,Tian, F,&Zhang, YQ.(2002).Hamilton-connectivity of 3-domination critical graphs with alpha=delta+2.EUROPEAN JOURNAL OF COMBINATORICS,23(7),777-784.
MLA	Chen, YJ,et al."Hamilton-connectivity of 3-domination critical graphs with alpha=delta+2".EUROPEAN JOURNAL OF COMBINATORICS 23.7(2002):777-784.