On the connectivity of (4; g)-cages

CSpace

	On the connectivity of (4; g)-cages
	Xu, BG ; Wang, P ; Wang, JF
	2002-07-01
发表期刊	ARS COMBINATORIA
ISSN	0381-7032
卷号	64 页码:181-192
摘要	A (k; g)-graph is a k-regular graph with girth g. A (k; g)-cage is a (k; g)-graph with the least possible number of vertices. In this paper, we prove that all (4; g)-cages are 4-connected, a special case of the conjecture about (k; g)-cages' connectivity made by H.L. Fu et al [1].
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics
WOS记录号	WOS:000177193200013
出版者	CHARLES BABBAGE RES CTR
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/17643
专题	中国科学院数学与系统科学研究院
作者单位	1.Chinese Acad Sci, Inst Appl Math, Beijing 100080, Peoples R China 2.St Francis Xavier Univ, Dept Math Stat & Comp Sci, Antigonish, NS B2G 2W5, Canada
推荐引用方式 GB/T 7714	Xu, BG,Wang, P,Wang, JF. On the connectivity of (4; g)-cages[J]. ARS COMBINATORIA,2002,64:181-192.
APA	Xu, BG,Wang, P,&Wang, JF.(2002).On the connectivity of (4; g)-cages.ARS COMBINATORIA,64,181-192.
MLA	Xu, BG,et al."On the connectivity of (4; g)-cages".ARS COMBINATORIA 64(2002):181-192.