On the connectivity of a random interval graph

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1098-2418(199608/09)9:1/2<137::AID-RSA9>3.0.CO;2-Y" /><137::AID-RSA9>3.0.CO;2-Y 10.1002/(SICI)1098-2418(199608/09)9:1/2<137::AID-RSA9>3.0.CO;2-YzbMath0864.05080OpenAlexW2042337206MaRDI QIDQ4894606

Erhard A. J. Godehardt, Jerzy Jaworski

Publication date: 7 October 1996

Full work available at URL: https://doi.org/10.1002/(sici)1098-2418(199608/09)9:1/2<137::aid-rsa9>3.0.co;2-y

zbMATH Keywords

probability distributionconnectivityrandom graphrandom interval graph

Mathematics Subject Classification ID

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

Related Items (14)

Central limit theorems for \(k\)-nearest neighbour distances ⋮ Topological properties of random wireless networks ⋮ Random subcube intersection graphs. I: Cliques and covering ⋮ Stochastic service systems, random interval graphs and search algorithms ⋮ One-dimensional geometric random graphs with nonvanishing densities. II: A very strong zero-one law for connectivity ⋮ Sharp threshold for embedding balanced spanning trees in random geometric graphs ⋮ A STRUCTURAL APPROACH TO THE REPRESENTATION OF LIFE HISTORY DATA¹ ⋮ A note on the 2-connectivity in one-dimensional ad hoc networks ⋮ Monotone properties of random geometric graphs have sharp thresholds ⋮ Connectivity in a random interval graph with access points ⋮ Plane and planarity thresholds for random geometric graphs ⋮ A tutorial survey of topics in wireless networking. II ⋮ On the typical case complexity of graph optimization ⋮ Two Models of Random Intersection Graphs and their Applications

This page was built for publication: On the connectivity of a random interval graph