A note on the edge-connectivity of cages

CSpace

	A note on the edge-connectivity of cages
	Wang, P ; Xu, BG ; Wang, JF
	2003
发表期刊	ELECTRONIC JOURNAL OF COMBINATORICS
ISSN	1077-8926
卷号	10 期号:1 页码:4
摘要	A (k; g)- graph is a k-regular graph with girth g. A ( k; g)- cage is a ( k; g)- graph with the smallest possible number of vertices. In this paper we prove that ( k; g)cages are k-edge-connected if k greater than or equal to 3 and g is odd.
语种	英语
WOS研究方向	Mathematics
WOS类目	Mathematics, Applied ; Mathematics
WOS记录号	WOS:000189113100049
出版者	ELECTRONIC JOURNAL OF COMBINATORICS
引用统计
文献类型	期刊论文
条目标识符	http://ir.amss.ac.cn/handle/2S8OKBNM/19107
专题	中国科学院数学与系统科学研究院
通讯作者	Wang, P
作者单位	1.St Francis Xavier Univ, Dept Math Stat & Comp Sci, Antigonish, NS B2G 2W5, Canada 2.Chinese Acad Sci, Inst Appl Math, Beijing 100080, Peoples R China
推荐引用方式 GB/T 7714	Wang, P,Xu, BG,Wang, JF. A note on the edge-connectivity of cages[J]. ELECTRONIC JOURNAL OF COMBINATORICS,2003,10(1):4.
APA	Wang, P,Xu, BG,&Wang, JF.(2003).A note on the edge-connectivity of cages.ELECTRONIC JOURNAL OF COMBINATORICS,10(1),4.
MLA	Wang, P,et al."A note on the edge-connectivity of cages".ELECTRONIC JOURNAL OF COMBINATORICS 10.1(2003):4.