Independence and connectivity in 3-domination-critical graphs

CSpace

	Independence and connectivity in 3-domination-critical graphs
	Zhang, LZ ; Tian, F
	2002-12-28
发表期刊	DISCRETE MATHEMATICS
ISSN	0012-365X
卷号	259 期号:1-3 页码:227-236
摘要	Let delta, gamma, kappa and alpha be, respectively, the minimum degree, the domination number, the connectivity and the independence number of a graph G. The graph G is 3-domination-critical if gamma = 3 and the addition of any edge decreases gamma by 1. In this paper, we prove that if G is a 3-domination-critical graph, then alpha less than or equal to kappa + 2; and moreover, if kappa less than or equal to delta - 1, then alpha less than or equal to K + 1. We also give a short proof of Wojcicka's result, which says that every connected 3-domination-critical graph of order at least 7 contains a hamiltonian path (J. Graph Theory 14 (1990) 205). (C) 2002 Elsevier Science B.V. All rights reserved.
关键词	three-domination-critical graph independence number connectivity
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics
WOS记录号	WOS:000180085900015
出版者	ELSEVIER SCIENCE BV
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/17113
专题	中国科学院数学与系统科学研究院
通讯作者	Zhang, LZ
作者单位	1.Zhangzhou Teachers Coll, Dept Math, Fujian 363000, Peoples R China 2.Chinese Acad Sci, Acad Math & Syst Sci, Inst Syst Sci, Beijing 100080, Peoples R China
推荐引用方式 GB/T 7714	Zhang, LZ,Tian, F. Independence and connectivity in 3-domination-critical graphs[J]. DISCRETE MATHEMATICS,2002,259(1-3):227-236.
APA	Zhang, LZ,&Tian, F.(2002).Independence and connectivity in 3-domination-critical graphs.DISCRETE MATHEMATICS,259(1-3),227-236.
MLA	Zhang, LZ,et al."Independence and connectivity in 3-domination-critical graphs".DISCRETE MATHEMATICS 259.1-3(2002):227-236.