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)

Related topics

Related topics

50 relations
1-planar graphAntiprism graphApex graphArchimedean graph

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
2-Connectivity in Directed Graphs: An Experimental Study
Graph connectivity is a fundamental concept in graph theory with numerous practical applications. Very recently, various notions… 
Highly Cited
2013
Highly Cited
2013
On Graphs, GPUs, and Blind Dating: A Workload to Processor Matchmaking Quest
Graph processing has gained renewed attention. The increasing large scale and wealth of connected data, such as those accrued by… 
2010
2010
Information Epidemics in Complex Networks with Opportunistic Links and Dynamic Topology
Wireless networks, especially mobile ad hoc networks (MANET) and cognitive radio networks (CRN), are facing two new challenges… 
2004
2004
Banana spiders: A study of connectivity in 3d combinatorial rigidity
Finding a combinatorial test for rigidity in 3D is an open problem. We prove that vertex connectivity cannot be used to construct… 
Highly Cited
2002
Highly Cited
2002
Approximation algorithms for minimum-cost k-vertex connected subgraphs
(MATH) We present two new algorithms for the problem of finding a minimum-cost k-vertex connected spanning subgraph. The first… 
2002
2002
Contractible edges in minimally k-connected graphs
2001
2001
Minimum cost source location problem with vertex-connectivity requirements in digraphs
1997
1997
A Note on Matchings and Spanning Trees with Bounded Degrees
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… 
1994
1994
Fault Tolerance of the Star Graph Interconnection Network
1984
1984
An algorithm for construction of a k-connected graph with minimum number of edges and quasiminimal diameter
Two fundamental considerations in the design of a communication network are reliability and maximum transmission delay. In this… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)