Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 228,400,054 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
50 relations
1-planar graph
Antiprism graph
Apex graph
Archimedean graph
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
Degree distance and vertex-connectivity
P. Ali
,
S. Mukwembi
,
S. Munyira
Discrete Applied Mathematics
2013
Corpus ID: 43176312
2010
2010
Information Epidemics in Complex Networks with Opportunistic Links and Dynamic Topology
Pin-Yu Chen
,
Kwang-Cheng Chen
IEEE Global Telecommunications Conference…
2010
Corpus ID: 3189512
Wireless networks, especially mobile ad hoc networks (MANET) and cognitive radio networks (CRN), are facing two new challenges…
Expand
2005
2005
Contractible Edges in 7-Connected Graphs
Jianji Su
,
Xudong Yuan
Graphs Comb.
2005
Corpus ID: 30250962
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…
Expand
Highly Cited
2002
Highly Cited
2002
Approximation algorithms for minimum-cost k-vertex connected subgraphs
J. Cheriyan
,
S. Vempala
,
A. Vetta
Symposium on the Theory of Computing
2002
Corpus ID: 3259368
(MATH) We present two new algorithms for the problem of finding a minimum-cost k-vertex connected spanning subgraph. The first…
Expand
2002
2002
Contractible edges in minimally k-connected graphs
Kiyoshi Ando
,
A. Kaneko
,
K. Kawarabayashi
Electron. Notes Discret. Math.
2002
Corpus ID: 12656169
2001
2001
Minimum cost source location problem with vertex-connectivity requirements in digraphs
H. Nagamochi
,
Toshimasa Ishii
,
Hiro Ito
Information Processing Letters
2001
Corpus ID: 21623115
1997
1997
A Note on Matchings and Spanning Trees with Bounded Degrees
Eduardo Rivera-Campo
Graphs Comb.
1997
Corpus ID: 45153304
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…
Expand
1994
1994
Fault Tolerance of the Star Graph Interconnection Network
Z. Jovanovic
,
J. Misic
Information Processing Letters
1994
Corpus ID: 42375855
1987
1987
On Finding the Vertex Connectivity of Graphs.
M. Girkar
,
M. Sohoni
1987
Corpus ID: 117777717
Abstract : An implementation of the fastest known algorithm to find the vertex connectivity of graphs with reduced space…
Expand
1984
1984
An algorithm for construction of a k-connected graph with minimum number of edges and quasiminimal diameter
U. Schumacher
Networks
1984
Corpus ID: 28744566
Two fundamental considerations in the design of a communication network are reliability and maximum transmission delay. In this…
Expand
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)
ACCEPT & CONTINUE