浏览全部资源
扫码关注微信
新疆大学数学与系统科学学院
纸质出版：2014
移动端阅览
[1]熊玮,张昭.有向线图的等周弧连通度(英文)[J].新疆大学学报(自然科学版),2014,31(02):166-167+173.
熊玮, 张昭. 有向线图的等周弧连通度(英文)[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 2014, 31(2): 166-167.
[1]熊玮,张昭.有向线图的等周弧连通度(英文)[J].新疆大学学报(自然科学版),2014,31(02):166-167+173. DOI：
熊玮, 张昭. 有向线图的等周弧连通度(英文)[J]. Journal of Xinjiang University (Natural Science Edition in Chinese and English), 2014, 31(2): 166-167. DOI：
一个有向图D的k-阶等周弧连通度定义为:γ+k(D)=min{|(U
U)|:U?V
|U|≥k
|U|≥k}.一个有向图满足γ+k(D)=β+k(D)时称为是γ+k-最优的
其中β+k(D)=min{|(U
|U|=k
|U|≥k}.假设D是强连通d-正则的有向图且κ(D)≥3.本文我们证明了L(D)是γ+2-最优的
其中L(D)表示D的线图.
The k-isoperimetric-arc-connectivity of a digraph D is defined as γ+k(D) = min{|(U
U)| : U V
|U| ≥ k
|U| ≥k}. A digraph with γ+k(D) = β+k(D) is called γ+k-optimal
where β+k(D) = min{|(U
|U| = k
|U| ≥ k}. Suppose D is a strongly connected d-regular digraph with κ(D) ≥ 3. In this paper
we prove that L(D) is γ+2-optimal
where L(D) is the line graph of D.
Xu J M.Topological Structure and Analysis of Interconnection Networks[M].Dordrecht:Kluwer Academic Publishers,2001.
Harary F.Conditional connectivity[J].Networks,1983,13:347-357.
Hamidoune Y O,Llad′o A S,Serra O,et al.On isoperimetric connectivity in vertex-transitive graphs[J].SIAM J Discrete Math,2000,13:139-144.
Hellwig A,Volkmann L.Maximally edge-connected and vertex-connected graphs and digraphs:A survey[J].Discrete Mathematics,2008,308:3256-3296.
Zhang Z.Extra edge connectivity and isoperimetric edge connectivity[J].Discrete Math,2008,308:4560-4569.
F`abrega J,Foil M A.On the extraconnectivity of graphs[J].Discrete Math,1996,155:49-57.
Bondy J A,Murty U S R.Graph Theory with Applications[M].New York,London:Elsevier,Macmillan,1976.
Zhang Z,Liu F X.Isoperimetric edge connectivity of line graphs and path graphs[J].Ars Comb,2011,98:483-491.
Bang-Jensen J,Gutin G.Digraphs:Theory,Algorithms and Applications[M].Berlin:Springer,2001.
0
浏览量
30
下载量
CSCD
关联资源
相关文章
相关作者
相关机构
京公网安备11010802024621
京公网安备11010802024621