Some properties of 3-domination-critical graphs

CSpace

	Some properties of 3-domination-critical graphs
	Flandrin, E ; Tian, F ; Wei, B ; Zhang, L
	1999-07-28
发表期刊	DISCRETE MATHEMATICS
ISSN	0012-365X
卷号	205 期号:1-3 页码:65-76
摘要	A graph G is 3-gamma-critical if its domination number gamma is 3 and the addition of any edge decreases gamma by 1. Wojcicka conjectured that every 3-gamma-critical graph with minimum degree delta greater than or equal to 2 has a hamiltonian cycle. in this paper, we prove that if G is a 3-gamma-critical connected graph of order n with minimum degree delta greater than or equal to 2, then (1) G is 1-tough; (2) the circumference of G is at least n - 1. (C) 1999 Elsevier Science B.V. All rights reserved.
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics
WOS记录号	WOS:000081625300006
出版者	ELSEVIER SCIENCE BV
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/14613
专题	中国科学院数学与系统科学研究院
作者单位	1.Univ Paris 11, CNRS, URA 410, LRI, F-91405 Orsay, France 2.Acad Sinica, Inst Syst Sci, Beijing 100080, Peoples R China
推荐引用方式 GB/T 7714	Flandrin, E,Tian, F,Wei, B,et al. Some properties of 3-domination-critical graphs[J]. DISCRETE MATHEMATICS,1999,205(1-3):65-76.
APA	Flandrin, E,Tian, F,Wei, B,&Zhang, L.(1999).Some properties of 3-domination-critical graphs.DISCRETE MATHEMATICS,205(1-3),65-76.
MLA	Flandrin, E,et al."Some properties of 3-domination-critical graphs".DISCRETE MATHEMATICS 205.1-3(1999):65-76.