The 3-domination-critical graphs with toughness one

CSpace

	The 3-domination-critical graphs with toughness one
	Chen, YJ; Tian, F; Wei, B
	2002-05-01
发表期刊	UTILITAS MATHEMATICA
ISSN	0315-3681
卷号	61 页码:239-253
摘要	A graph G is 3-domination-critical if its domination number gamma is 3 and the addition of any edge decreases gamma by 1. In this paper, we give a sufficient and necessary condition for a connected 3-domination-critical G to have toughness tau(G) = 1.
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics, Applied ; Statistics & Probability
WOS记录号	WOS:000175585400017
出版者	UTIL MATH PUBL INC
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/16984
专题	中国科学院数学与系统科学研究院
作者单位	Chinese Acad Sci, Acad Math & Syst Sci, Inst Syst Sci, Beijing 100080, Peoples R China
推荐引用方式 GB/T 7714	Chen, YJ,Tian, F,Wei, B. The 3-domination-critical graphs with toughness one[J]. UTILITAS MATHEMATICA,2002,61:239-253.
APA	Chen, YJ,Tian, F,&Wei, B.(2002).The 3-domination-critical graphs with toughness one.UTILITAS MATHEMATICA,61,239-253.
MLA	Chen, YJ,et al."The 3-domination-critical graphs with toughness one".UTILITAS MATHEMATICA 61(2002):239-253.