Super lambda(3)-optimality of regular graphs

CORC > 厦门大学 > 数学科学－已发表论文

	Super lambda(3)-optimality of regular graphs
	Guo, Litao ; Liu, Ruifang ; Guo, Xiaofeng ; Guo XF(郭晓峰)
刊名	http://dx.doi.org/10.1016/j.aml.2011.07.018
	2012-02
关键词	CONDITIONAL EDGE-CONNECTIVITY RELIABILITY-ANALYSIS HYPERCUBES
英文摘要	NSFC [10831001]; National Natural Science Foundation of China [11026055]; Fundamental Research Funds for the Central Universities, China [2010121076]; Fujian Province, China [2007H2002]; Let G = (V, E) be a connected graph. An edge set S subset of E is a 3-restricted edge cut, if G - S is disconnected and every component of G - S has at least three vertices. The 3-restricted edge connectivity lambda(3)(G) of G is the cardinality of a minimum 3-restricted edge cut of G. A graph G is lambda(3)-connected, if 3-restricted edge cuts exist. A graph G is called lambda(3)-optimal, if lambda(3)(G) = xi(3)(G), where xi(3)(G) = min{vertical bar[X, (X) over bar]vertical bar : X subset of V, vertical bar X vertical bar = 3. G[X] is connected}, [X, (X) over bar] is the set of edges of G with one end in X and the other in (X) over bar and (X) over bar = V - X. Furthermore, if every minimum 3-restricted edge cut is a set of edges incident to a connected subgraph induced by three vertices, then G is said to be super 3-restricted edge connected or super-lambda(3) for simplicity. In this paper we show that let G be a k-regular connected graph of order n >= 6, if k >= left perpendicularn/2right perpendicular + 3, then G is super-lambda(3). (C) 2011 Elsevier Ltd. All rights reserved.
语种	英语
内容类型	期刊论文
源URL	[http://dspace.xmu.edu.cn/handle/2288/66739]
专题	数学科学－已发表论文
推荐引用方式 GB/T 7714	Guo, Litao,Liu, Ruifang,Guo, Xiaofeng,et al. Super lambda(3)-optimality of regular graphs[J]. http://dx.doi.org/10.1016/j.aml.2011.07.018,2012.
APA	Guo, Litao,Liu, Ruifang,Guo, Xiaofeng,&郭晓峰.(2012).Super lambda(3)-optimality of regular graphs.http://dx.doi.org/10.1016/j.aml.2011.07.018.
MLA	Guo, Litao,et al."Super lambda(3)-optimality of regular graphs".http://dx.doi.org/10.1016/j.aml.2011.07.018 (2012).