给定围长的图的超三限制性连通度的充分条件(英文)

代玉林; 孟吉翔

您当前的位置：

首页 >

文章列表页 >

给定围长的图的超三限制性连通度的充分条件(英文)

数理科学 | 更新时间：2026-01-21

- 给定围长的图的超三限制性连通度的充分条件(英文)
- 给定围长的图的超三限制性连通度的充分条件(英文)
- 新疆大学学报（自然科学版中英文） 2011年28卷第1期页码：14-22
- 作者机构：
  
  新疆大学数学与系统科学学院
- 作者简介：
- 基金信息：
  
  supported by NSFC(No.10671165)
- DOI：
  中图分类号： O157.5
- 纸质出版：2011
- 稿件说明：
移动端阅览
[1]代玉林,孟吉翔.给定围长的图的超三限制性连通度的充分条件(英文)[J].新疆大学学报(自然科学版),2011,28(01):14-22.

代玉林, 孟吉翔. 给定围长的图的超三限制性连通度的充分条件(英文)[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 2011, 28(1): 14-22.
[1]代玉林,孟吉翔.给定围长的图的超三限制性连通度的充分条件(英文)[J].新疆大学学报(自然科学版),2011,28(01):14-22. DOI：

代玉林, 孟吉翔. 给定围长的图的超三限制性连通度的充分条件(英文)[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 2011, 28(1): 14-22. DOI：

摘要

图G是一个连通图.称X为三限制性割

如果G-X的每个连通分支至少有三个点.三限制性连通度κ3(G)是三限制性割的最小基数

更进一步

如果图G的围长为4

去掉最小的三限制性割孤立出一条二长路

则称它是超三限制性连通的.本文给定了图是超三限制性连通的直径围长充分条件

还研究了超三限制性边连通图.

Abstract

Let G = (V

E) be a connected graph. A vertex-cut X is said to be a 3-restricted cut of G if G ? X is notconnected and every component of G - X has at least three vertices. The 3-restricted connectivity κ3(G) of a connectedgraph G is defined as the minimum cardinality of a 3-restricted cut. Additionally

if G is a graph with girth g ≥ 4 suchthat the deletion of every minimum 3-restricted cut isolates a 2-path

then G is said to be super 3-restricted connected. Inthis paper

we give some sufficient conditions for a graph to be super 3-restricted connected in terms of the girth and thediameter

we also study super 3-restricted edge connected graph.

关键词

Keywords

references

Bondy J A,Murty U S R.Graph Theory with Applications[M].London:Macmilla Press,1976.

Harary F.Conditional connectivity[J].Network,1983,13:367-357.

GUO Li-tao,MENG Ji-xiang.3-restricted connectivity of graphs with given girth[J].Appl Math,2008,25(1):117-123.

Meng J X,Ji Y H.On a kind of restricted edge connectivity of graphs[J].Discrete Appl Math,2002,117:183-193.

Balbuena Camino,Lin Yu-qing,Miller Mirka.Diameter-suffuicient conditions for a graph to be super-restricted connected[J].Discrete ApplMath,2008,156:2827-2834.

Fabrega J,Fiol M A.Extraconnectivity of graphs with large girth[J].Discrete Math,1994,127:163-170.

Bonsma P,Ueffing N,Volkman L.Edge-cuts leaving components of order at least three[J].Discrete Math,2002,256:431-439.

Esfahanian A H,Hakimi S L.On computing a conditional edge connectivity of a graph[J].Inform Process Lett,1988,27:195-199.

Balbuena C,Cera M,Dia′nez A,et al.Diameter-girth sufficient conditions for optimal extraconnectivity in graphs[J].Discrete math,2008,308:3526-3536.

Balbuena C,Garcia-Va′zquez P,Marcote X.Suffiencient conditions forλ-optimality in graphs with girth g[J].J Graph Theory,2006,52:73-86.

浏览量

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

特征值互不相同的图(英文)

图G的周长与围长

有向循环图的直径与覆盖指数

广义笛卡尔积图的连通度

线团图的一些性质