

浏览全部资源
扫码关注微信
新疆大学数学与系统科学学院
Published:2010
移动端阅览
[1]陈影影,孟吉翔,田应智.Harary图的外连通度(英文)[J].新疆大学学报(自然科学版),2010,27(01):27-31.
陈影影, 孟吉翔, 田应智. Harary图的外连通度(英文)[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 2010, 27(1): 27-31.
一个顶点集是一个Rg-点割
如果它将一个连通图分割成一些连通分支使得每个连通分支至少含有g个顶点.图G的g-外连通度(记作κg(G))是Rg-点割的最小基数.图G的通常的点连通度和上连通度分别相应的为κ0(G)和κ1(G).本文将分别证出第一类和第二类Harary图的κg和刻画它们的Rg-点原子部分.
A vertex cut that separates the connected graph into components such that every components has at least g vertices is a Rg-vertex-cut.The g-extraconnectivity of G(written κg(G)) is the minimum cardinality of Rg-vertex-cut.The usual connectivity and superconnectivity of G correspond to κ0(G) andκ1(G)
respectively.In this paper
we will determine κg and characterize the Rg-vertex-atom-part for the first and second type Harary graphs.
Najjar W,Gaudiot J L.Network resilience:A measure of network fault tolerance[J].IEEE Transactions on Computers,1990,39(2):174-181.
Harary F.Conditional connectivity[J].Networks,1983,13:347-357.
Fabrega J,Fiol M A.On the extraconnectivity of graphs[J].Discrete Mathematics,1996,155:49-57.
Bondy J A,Murty U S R.Graph Theory with Application[M].London:Macmillan,1976.
Deng H,Chen J,Li Q,et al.On the construction of most reliable networks[J].Discrete Appl Math,2004,140:19-33.
Wang G,Zhang L,The structure of maxλ-minmλ+1 graphs used in the design of reliable networks[J].Networks,1997,30:231-242.
Li Q L,Li Q.Reliability analysis of circulant graphs[J].Networks,1998,31:61-65.
0
Views
57
下载量
0
CSCD
Publicity Resources
Related Articles
Related Author
Related Institution
京公网安备11010802024621