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
In-Network Stabilizations of Dynmical Systems
Maintenance of wireless network system is the major problem now a days. computational methods in wireless networks degrade the… 
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… 
2013
2013
Fundamental limits of cyber-physical security in smart power grids
Cyber-physical security of power systems under power injection attacks that alter generation and loads is studied. The system… 
2012
2012
Grid Based Wireless Mobile Sensor Network Deployment with Obstacle Adaptability
Mobile Sensors find their target position and placed themselves over the target field to achieve a certain goal in self… 
2010
2010
The Balanced Decomposition Number and Vertex Connectivity
The balanced decomposition number $f(G)$ of a graph $G$ was introduced by Fujita and Nakamigawa [Discr. Appl. Math., 156 (2008… 
2006
2006
QSPR study of polarographic half-wave reduction potentials of benzenoid hydrocarbons
Correlation between the polarographic half-wave reduction potentials and the set of molecular descriptors of lower benzenoid… 
2005
2005
Contractible Edges in 7-Connected Graphs
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… 
2005
2005
A new Approach of Seed-Set Finding for Iso-Surface Extraction
Iso-surface extraction is one of the most important approaches for volume rendering, and iso-contouring algorithm is one of the… 
2003
2003
ON GENERALIZED WIDE DIAMETER OF GRAPHS
The wide diameter of a graph is a natural generalization of diameter in a graph when we take account of the connectivity of the… 
1987
1987
On Finding the Vertex Connectivity of Graphs.
Abstract : An implementation of the fastest known algorithm to find the vertex connectivity of graphs with reduced space…