Expander Properties and the Cover Time of Random Intersection Graphs

DOI10.1007/978-3-540-74456-6_6zbMath1147.05307OpenAlexW4251701219MaRDI QIDQ3525554

Christoforos L. Raptopoulos, Paul G. Spirakis, Sotiris E. Nikoletseas

Publication date: 17 September 2008

Published in: Mathematical Foundations of Computer Science 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74456-6_6

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10)

Related Items (6)

A Note on the Conductance of the Binomial Random Intersection Graph ⋮ On the independence number and Hamiltonicity of uniform random intersection graphs ⋮ Large independent sets in general random intersection graphs ⋮ Sharp thresholds for Hamiltonicity in random intersection graphs ⋮ Selected Combinatorial Properties of Random Intersection Graphs ⋮ Expander properties and the cover time of random intersection graphs

This page was built for publication: Expander Properties and the Cover Time of Random Intersection Graphs