k-connectivity of uniform s-intersection graphs

DOI10.1016/J.DISC.2014.06.014zbMATH Open1298.05181OpenAlexW2092179843MaRDI QIDQ400409FDOQ400409

Authors: 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

Recommendations

• On \(k\)-connectivity and minimum vertex degree in random \(s\)-intersection graphs
• Connectivity of the uniform random intersection graph
• On the isolated vertices and connectivity in random intersection graphs
• Diameter, connectivity, and phase transition of the uniform random intersection graph
• The intersection graph of random sets

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (3)

• Connectivity of the uniform random intersection graph
• Hamilton cycles in the line graph of a random hypergraph
• On the isolated vertices and connectivity in random intersection graphs

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

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