Super restricted edge-connectivity of graphs with diameter 2
Super restricted edge-connectivity of graphs with diameter 2
复制标题
直径为2的图的超限制边连通性
DOI：
10.1016/j.dam.2012.08.030
复制
发表时间：
2013-02
影响因子：
1.1
通讯作者：
Zhang, Heping
中科院分区：
文献类型：
--
作者：
Shang, Li;Zhang, Heping
For a connected graph G, an edge-cut S is called a restricted edge-cut if G−S contains no isolated vertices. And G is said to be super restricted edge-connected, for short super-λ′, if each minimum restricted edge-cut of G isolates an edge. Let Vδdenote the set of the minimum degree vertices of G. In this paper, for a super-λ′graph G with diameter D≥2 and minimum degree δ≥4, we show that the induced subgraph G[Vδ] contains no complete graph Kδ−1. Applying this property we characterize the super restricted edge connected graphs with diameter 2 which satisfy a type of neighborhood condition. This result improves the previous related one which was given by Wang et al. [S. Wang, J. Li, L. Wu, S. Lin, Neighborhood conditions for graphs to be super restricted edge connected, Networks 56 (2010) 11–19].
登录
查看更多内容
DOI：
10.1016/s0012-365x(02)00299-6
发表时间：
2002-12
期刊：
Discret. Math.
影响因子：
--
作者：
Ming Wang;Qiao Li
通讯作者：
Ming Wang;Qiao Li
DOI：
10.1016/j.disc.2008.07.022
发表时间：
2009-05
期刊：
Discret. Math.
影响因子：
--
作者：
Jun Yuan;Aixia Liu;Shiying Wang
通讯作者：
Jun Yuan;Aixia Liu;Shiying Wang
DOI：
10.1016/j.ipl.2009.02.025
发表时间：
2009-06
期刊：
Inf. Process. Lett.
影响因子：
--
作者：
Juan Liu;Xing Chen;J. Meng
通讯作者：
Juan Liu;Xing Chen;J. Meng
影响因子：
6.9
作者：
Junming Xu
通讯作者：
Junming Xu
DOI：
10.1016/j.dam.2008.04.010
发表时间：
2009-04
期刊：
Discret. Appl. Math.
影响因子：
--
作者：
C. Balbuena;Diego González-Moreno;X. Marcote
通讯作者：
C. Balbuena;Diego González-Moreno;X. Marcote