Bounds on probability of connectedness of a random graph
From MaRDI portal
Publication:803174
zbMATH Open0727.05055MaRDI QIDQ803174FDOQ803174
Authors: V. P. Polesskij 
Publication date: 1990
Published in: Problems of Information Transmission (Search for Journal in Brave)
Recommendations
- Lower bounds on the probability of connectedness in classes of random graphs generated by 2-connected graphs with a given base spectrum
- scientific article; zbMATH DE number 1070707
- A Sharp Threshold for Network Reliability
- When are random graphs connected
- scientific article; zbMATH DE number 3904623
Cited In (16)
- COUNTABLY APPROXIMATING FRAMES
- Probabilistic analysis of upper bounds for 2-connected distance \(k\)-dominating sets in graphs
- Lower bounds of connectedness probability for some classes of random graphs
- Upper bounds on the connection probability for 2-D meshes and tori
- Connected components in random graphs with given expected degree sequences
- Connectedness of graphs generated by a random d-process
- A Sharp Threshold for Network Reliability
- The connectivity threshold for the min‐degree random graph process
- Title not available (Why is that?)
- Lower bounds on full rank probability in random matroids
- ℓ $\ell $‐Connectivity and ℓ $\ell $‐edge‐connectivity of random graphs
- Connectivity threshold for random chordal graphs
- Lower bounds for transition probabilities on graphs
- Tight Bounds on Vertex Connectivity Under Sampling
- On the strength of connectedness of a random hypergraph
- A probabilistic algorithm for vertex connectivity of graphs
This page was built for publication: Bounds on probability of connectedness of a random graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q803174)
