Connectivity and super connectivity of the divide-and-swap cube

2020 ◽  
Vol 842 ◽  
pp. 1-5 ◽  
Author(s):  
Wantao Ning
Keyword(s):  
Mathematics ◽  
2019 ◽  
Vol 7 (3) ◽  
pp. 267 ◽  
Author(s):  
Yilun Shang

The super connectivity κ ′ ( G ) of a graph G is the minimum cardinality of vertices, if any, whose deletion results in a disconnected graph that contains no isolated vertex. G is said to be r-super connected if κ ′ ( G ) ≥ r . In this note, we establish some asymptotic almost sure results on r-super connectedness for classical Erdős–Rényi random graphs as the number of nodes tends to infinity. The known results for r-connectedness are extended to r-super connectedness by pairing off vertices and estimating the probability of disconnecting the graph that one gets by identifying the two vertices of each pair.


2005 ◽  
Vol 96 (4) ◽  
pp. 123-127 ◽  
Author(s):  
Jun-Ming Xu ◽  
Min Xu ◽  
Qiang Zhu
Keyword(s):  

2003 ◽  
Vol 140 (2-3) ◽  
pp. 245-254 ◽  
Author(s):  
Y-Chuang Chen ◽  
Jimmy J.M. Tan ◽  
Lih-Hsing Hsu ◽  
Shin-Shin Kao

2016 ◽  
Vol 116 (7) ◽  
pp. 460-466 ◽  
Author(s):  
Jou-Ming Chang ◽  
Xiang-Rui Chen ◽  
Jinn-Shyong Yang ◽  
Ro-Yu Wu

2019 ◽  
Vol 39 (1) ◽  
pp. 5 ◽  
Author(s):  
Gülnaz Boruzanli Ekinci ◽  
John Baptist Gauci

2019 ◽  
Vol 142 ◽  
pp. 52-56 ◽  
Author(s):  
Xuepeng Cai ◽  
Elkin Vumar
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document