Bounds for the super extra edge connectivity of graphs

Chia Wen Cheng, Sun-Yuan Hsieh

研究成果: Conference contribution

4 引文 斯高帕斯(Scopus)

摘要

Let G be a connected graph, S be a subset of edges in G, and k be a positive integer. If G - S is disconnected and every component has at least k vertices, then S is a k-extra edge-cut of G. The k-extra edge-connectivity, denoted by λk(G), is the minimum cardinality over all k-extra edge-cuts of G. If λk(G) exists and at least one component of G - S contains exactly k vertices for any minimum k-extra edge-cut S, then G is super-λk. Moreover, when G is super-λk, the persistence of G, denoted by ρk(G), is the maximum integer m for which G-F is still super-λk for any set F ⊆ E(G) with |F| ≤ m. It has been shown that the bounds of ρk(G) when k ∈ {1, 2}. This study shows the bounds of ρk(G) when k ≥ 3.

原文English
主出版物標題Computing and Combinatorics - 21st International Conference, COCOON 2015, Proceedings
編輯Dachuan Xu, Donglei Du, Dingzhu Du
發行者Springer Verlag
頁面624-631
頁數8
ISBN(列印)9783319213972
DOIs
出版狀態Published - 2015 一月 1
事件21st International Conference on Computing and Combinatorics Conference, COCOON 2015 - Beijing, China
持續時間: 2015 八月 42015 八月 6

出版系列

名字Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
9198
ISSN(列印)0302-9743
ISSN(電子)1611-3349

Other

Other21st International Conference on Computing and Combinatorics Conference, COCOON 2015
國家/地區China
城市Beijing
期間15-08-0415-08-06

All Science Journal Classification (ASJC) codes

  • 理論電腦科學
  • 電腦科學(全部)

指紋

深入研究「Bounds for the super extra edge connectivity of graphs」主題。共同形成了獨特的指紋。

引用此