Note on the hardness of generalized connectivity

Shasha Li () and Xueliang Li ()
Additional contact information
Shasha Li: Nankai University
Xueliang Li: Nankai University

Journal of Combinatorial Optimization, 2012, vol. 24, issue 3, No 17, 389-396

Abstract: Abstract Let G be a nontrivial connected graph of order n and let k be an integer with 2≤k≤n. For a set S of k vertices of G, let κ(S) denote the maximum number ℓ of edge-disjoint trees T 1,T 2,…,T ℓ in G such that V(T i )∩V(T j )=S for every pair i,j of distinct integers with 1≤i,j≤ℓ. Chartrand et al. generalized the concept of connectivity as follows: The k-connectivity, denoted by κ k (G), of G is defined by κ k (G)=min{κ(S)}, where the minimum is taken over all k-subsets S of V(G). Thus κ 2(G)=κ(G), where κ(G) is the connectivity of G, for which there are polynomial-time algorithms to solve it. This paper mainly focus on the complexity of determining the generalized connectivity of a graph. At first, we obtain that for two fixed positive integers k 1 and k 2, given a graph G and a k 1-subset S of V(G), the problem of deciding whether G contains k 2 internally disjoint trees connecting S can be solved by a polynomial-time algorithm. Then, we show that when k 1 is a fixed integer of at least 4, but k 2 is not a fixed integer, the problem turns out to be NP-complete. On the other hand, when k 2 is a fixed integer of at least 2, but k 1 is not a fixed integer, we show that the problem also becomes NP-complete.

Keywords: k-connectivity; Internally disjoint trees; Complexity; Polynomial-time; NP-complete (search for similar items in EconPapers)
Date: 2012
References: View complete reference list from CitEc
Citations: View citations in EconPapers (10)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-011-9399-x 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:24:y:2012:i:3:d:10.1007_s10878-011-9399-x

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

DOI: 10.1007/s10878-011-9399-x

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 ().