Mixed connectivity of random graphs

DOI10.1007/978-3-319-71150-8_13MaRDI QIDQ1699774zbMATH OpenOpenAlexFDO

Authors 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

connectivityedge-connectivityhitting timerandom graphthreshold function

Mathematics Subject Classification ID

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

Recommendations

• Mixed connectivity properties of random graphs and some special graphs
• ℓ $\ell $‐Connectivity and ℓ $\ell $‐edge‐connectivity of random graphs
• \(k\)-connectivity in random graphs
• On resilience of connectivity in the evolution of random graphs
• On the strength of connectedness of a random hypergraph

Cited in

(5)

• 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
• Connectivity of Poissonian inhomogeneous random multigraphs
• Survival time of a random graph

This page was built for publication: Mixed connectivity of random graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1699774)