EconPapers    
Economics at your fingertips  
 

A solution to a conjecture on the generalized connectivity of graphs

Lily Chen (), Xueliang Li (), Mengmeng Liu () and Yaping Mao ()
Additional contact information
Lily Chen: Huaqiao University
Xueliang Li: Nankai University
Mengmeng Liu: Nankai University
Yaping Mao: Nankai University

Journal of Combinatorial Optimization, 2017, vol. 33, issue 1, No 19, 275-282

Abstract: Abstract The generalized k-connectivity $$\kappa _k(G)$$ κ k ( G ) of a graph G was introduced by Chartrand et al. in (Bull Bombay Math Colloq 2:1–6, 1984), which is a nice generalization of the classical connectivity. Recently, as a natural counterpart, Li et al. proposed the concept of generalized edge-connectivity for a graph. In this paper, we consider the computational complexity of the generalized connectivity and generalized edge-connectivity of a graph. We give a confirmative solution to a conjecture raised by S. Li in Ph.D. Thesis (2012). We also give a polynomial-time algorithm to a problem of generalized k-edge-connectivity.

Keywords: Generalized connectivity; Generalized edge-connectivity; Complexity; Polynomial-time algorithm; $$\mathcal {N}\mathcal {P}$$ N P -complete; 05C40; 05C05; 68Q25; 68R10 (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-015-9955-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:33:y:2017:i:1:d:10.1007_s10878-015-9955-x

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

DOI: 10.1007/s10878-015-9955-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 ().

 
Page updated 2025-03-20
Handle: RePEc:spr:jcomop:v:33:y:2017:i:1:d:10.1007_s10878-015-9955-x