On Connectivity and Robustness in Random Intersection Graphs

DOI10.1109/TAC.2016.2601564zbMath1366.05101arXiv1911.01822MaRDI QIDQ5280399

Virgil Gligor, Jun Zhao, Osman Yaǧan

Publication date: 27 July 2017

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1911.01822

Mathematics Subject Classification ID

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

Related Items (4)

Percolation theories for multipartite networked systems under random failures ⋮ Characterization of expansion-related properties of modular graphs ⋮ Determining \(r\)- and \((r,s)\)-robustness of digraphs using mixed integer linear programming ⋮ Isoperimetric numbers of randomly perturbed intersection graphs

This page was built for publication: On Connectivity and Robustness in Random Intersection Graphs