On the connectivity of a random interval graph

DOI10.1002/(SICI)1098-2418(199608/09)9:1/2%3C137::AID-RSA9%3E3.0.CO;2-YMaRDI QIDQ4894606zbMATH OpenOpenAlexFDO

Authors 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%3C137::aid-rsa9%3E3.0.co;2-y

zbMATH Keywords

connectivityprobability distributionrandom graphrandom interval graph

Mathematics Subject Classification ID

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

Recommendations

• Random interval graphs
• The connectivity of a graph on uniform points on [0,\,1]\(^{d}\).
• When are random graphs connected
• On the connectedness of a random graph
• An evolution of interval graphs

Cited in

(38)

• A tutorial survey of topics in wireless networking. II
• Random interval graphs
• Connectivity threshold for random chordal graphs
• Lower bounds of connectedness probability for some classes of random graphs
• Central limit theorems for \(k\)-nearest neighbour distances
• The connectivity of a graph on uniform points on [0,\,1]\(^{d}\).
• Asymptotic connectedness of random interval graphs in a one dimensional data delivery problem
• Diameter, connectivity, and phase transition of the uniform random intersection graph
• On the strength of connectedness of a random hypergraph
• Topological properties of random wireless networks
• Stationary random graphs on Z with prescribed iid degrees and finite mean connections
• Monotone properties of random geometric graphs have sharp thresholds
• On the typical case complexity of graph optimization
• Continuous-time independent edge-Markovian random graph process
• On the independence number of random interval graphs
• On the easiest way to connect k points in the random interlacements process
• Stochastic service systems, random interval graphs and search algorithms
• Random subcube intersection graphs. I: Cliques and covering
• On the connectedness of a random graph
• Two Models of Random Intersection Graphs and their Applications
• The sizes of components in random circle graphs
• scientific article; zbMATH DE number 3923752 (Why is no real title available?)
• One-dimensional geometric random graphs with nonvanishing densities. II: A very strong zero-one law for connectivity
• scientific article; zbMATH DE number 1222260 (Why is no real title available?)
• Connectedness of graphs generated by a random d-process
• A STRUCTURAL APPROACH TO THE REPRESENTATION OF LIFE HISTORY DATA¹
• Connectivity of random k-nearest-neighbour graphs
• On the connectivity of graphs generated by a sum of random mappings
• COUNTABLY APPROXIMATING FRAMES
• A random-line-graph approach to overlapping line segments
• Plane and planarity thresholds for random geometric graphs
• On Connectivity and Robustness in Random Intersection Graphs
• A note on the 2-connectivity in one-dimensional ad hoc networks
• ℓ $\ell $‐Connectivity and ℓ $\ell $‐edge‐connectivity of random graphs
• Sharp threshold for embedding balanced spanning trees in random geometric graphs
• The phase transitions of diameters in random axis-parallel hyperrectangle intersection graphs
• An evolution of interval graphs
• Connectivity in a random interval graph with access points

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

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