\(k\)-connectivity of uniform \(s\)-intersection graphs

DOI10.1016/J.DISC.2014.06.014zbMath1298.05181OpenAlexW2092179843MaRDI QIDQ400409

Mindaugas Bloznelis, Katarzyna Rybarczyk

Publication date: 21 August 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2014.06.014

zbMATH Keywords

wireless sensor network\(k\)-connectivityrandom intersection graph

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)

Cites Work

• Connectivity of the uniform random intersection graph
• Degree and clustering coefficient in sparse random intersection graphs
• Diameter, connectivity, and phase transition of the uniform random intersection graph
• Perfect matchings in random intersection graphs
• On the strength of connectedness of a random graph
• Component evolution in a secure wireless sensor network
• Zero–One Laws for Connectivity in Random Key Graphs
• Unnamed Item

This page was built for publication: \(k\)-connectivity of uniform \(s\)-intersection graphs