Super Connectivity of Erdős-Rényi Graphs
Department of Computer and Information Sciences, Faculty of Engineering and Environment, Northumbria University, Newcastle NE1 8ST, UK
Received: 9 February 2019 / Revised: 8 March 2019 / Accepted: 12 March 2019 / Published: 15 March 2019
The super connectivity
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
. 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.
This is an open access article distributed under the Creative Commons Attribution License
which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
Share & Cite This Article
MDPI and ACS Style
Shang, Y. Super Connectivity of Erdős-Rényi Graphs. Mathematics 2019, 7, 267.
Shang Y. Super Connectivity of Erdős-Rényi Graphs. Mathematics. 2019; 7(3):267.
Shang, Yilun. 2019. "Super Connectivity of Erdős-Rényi Graphs." Mathematics 7, no. 3: 267.
Show more citation formats
Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.
[Return to top]
For more information on the journal statistics, click here
Multiple requests from the same IP address are counted as one view.