Computation and algorithm for the minimum k-edge-connectivity of graphs

Yuefang Sun (), Chenchen Wu (), Xiaoyan Zhang () and Zhao Zhang ()
Additional contact information
Yuefang Sun: Ningbo University
Chenchen Wu: Tianjin University of Technology
Xiaoyan Zhang: Nanjing Normal University
Zhao Zhang: Zhejiang Normal University

Journal of Combinatorial Optimization, No 0, 12 pages

Abstract: Abstract Boesch and Chen (SIAM J Appl Math 34:657–665, 1978) introduced the cut-version of the generalized edge-connectivity, named k-edge-connectivity. For any integer k with $$2\le k\le n$$2≤k≤n, the k-edge-connectivity of a graph G, denoted by $$\lambda _k(G)$$λk(G), is defined as the smallest number of edges whose removal from G produces a graph with at least k components. In this paper, we first compute some exact values and sharp bounds for $$\lambda _k(G)$$λk(G) in terms of n and k. We then discuss the relationships between $$\lambda _k(G)$$λk(G) and other generalized connectivities. An algorithm in $$\mathcal {O}(n^2)$$O(n2) time will be provided such that we can compute a sharp upper bound in terms of the maximum degree. Among our results, we also compute some exact values and sharp bounds for the function f(n, k, t) which is defined as the minimum size of a connected graph G with order n and $$\lambda _k(G)=t$$λk(G)=t.

Keywords: k-edge-connectivity; k-connectivity; Generalized connectivity; S-Steiner tree; k-way cut (search for similar items in EconPapers)
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-020-00541-z Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v::y::i::d:10.1007_s10878-020-00541-z

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-020-00541-z

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().