Codiameters of 3-connected 3-domination critical graphs

CSpace

	Codiameters of 3-connected 3-domination critical graphs
	Chen, YJ ; Tian, F ; Wei, B
	2002
发表期刊	JOURNAL OF GRAPH THEORY
ISSN	0364-9024
卷号	39 期号:1 页码:76-85
摘要	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 of order n. In this paper, we show that there is a path of length at least n-2 between any two distinct vertices in G and the lower bound is sharp. (C) 2002 John Wiley & Sons, Inc.
关键词	codiameter 3-connected domination critical
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics
WOS记录号	WOS:000172979100005
出版者	JOHN WILEY & SONS INC
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/17963
专题	中国科学院数学与系统科学研究院
通讯作者	Chen, YJ
作者单位	1.Nanjing Univ, Dept Math, Nanjing 210093, Peoples R China 2.Chinese Acad Sci, Acad Math & Syst Sci, Inst Syst Sci, Beijing 100080, Peoples R China
推荐引用方式 GB/T 7714	Chen, YJ,Tian, F,Wei, B. Codiameters of 3-connected 3-domination critical graphs[J]. JOURNAL OF GRAPH THEORY,2002,39(1):76-85.
APA	Chen, YJ,Tian, F,&Wei, B.(2002).Codiameters of 3-connected 3-domination critical graphs.JOURNAL OF GRAPH THEORY,39(1),76-85.
MLA	Chen, YJ,et al."Codiameters of 3-connected 3-domination critical graphs".JOURNAL OF GRAPH THEORY 39.1(2002):76-85.