Skip to search formSkip to main contentSkip to account menu

K-vertex-connected graph

Known as: K-connected graph, Vertex connectivity 
In graph theory, a connected graph G is said to be k-vertex-connected (or k-connected) if it has more than k vertices and remains connected whenever… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Wireless networks, especially mobile ad hoc networks (MANET) and cognitive radio networks (CRN), are facing two new challenges… 
2005
2005
An edge of a k-connected graph is said to be a k-contractible edge, if its contraction yields again a k-connected graph. A… 
Highly Cited
2002
Highly Cited
2002
(MATH) We present two new algorithms for the problem of finding a minimum-cost k-vertex connected spanning subgraph. The first… 
2002
2002
1997
1997
If M is a perfect matching in a k-connected graph G with independence number $$\alpha \le 1 + {3 \over 2}k$$, then M can be… 
1987
1987
Abstract : An implementation of the fastest known algorithm to find the vertex connectivity of graphs with reduced space… 
1984
1984
Two fundamental considerations in the design of a communication network are reliability and maximum transmission delay. In this…