Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Mixed connectivity of random graphs

From MaRDI portal
Publication:1699774
Jump to:navigation, search

DOI10.1007/978-3-319-71150-8_13zbMath1470.05146OpenAlexW2769367182MaRDI QIDQ1699774

Ran Gu, Yongtang Shi, Neng Fan

Publication date: 26 February 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-71150-8_13


zbMATH Keywords

connectivityrandom graphhitting timeedge-connectivitythreshold function


Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Connectivity (05C40)


Related Items

The \(\lambda_3\)-connectivity and \(\kappa_3\)-connectivity of recursive circulants ⋮ The \(p\)-restricted edge-connectivity of Kneser graphs ⋮ Mixed connectivity properties of random graphs and some special graphs



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1699774&oldid=14023310"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 07:02.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki