Connectivity for a modified binomial random graph by agglomeration

MaRDI QIDQ2789559zbMATH OpenFDO

Authors Mihyun Kang, Angelica Pachón, Pablo Martín Rodríguez

Publication date 1 March 2016

Full work available at URL https://hal.inria.fr/hal-01077251v2/document

zbMATH Keywords

connectednessErdős-Rényi random graphinhomogeneous random graph

Mathematics Subject Classification ID

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

Recommendations

• Evolution of a modified binomial random graph by agglomeration
• Connectivity of inhomogeneous random graphs
• Connectivity of Poissonian inhomogeneous random multigraphs
• The phase transition in inhomogeneous random graphs
• On the isolated vertices and connectivity in random intersection graphs

Cited in

(4)

• Evolution of a modified binomial random graph by agglomeration
• Connectivity of inhomogeneous random graphs
• The natural connectivity of colored random graphs
• On connectivity and robustness of random graphs with inhomogeneity

This page was built for publication: Connectivity for a modified binomial random graph by agglomeration

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