k-connectivity of uniform s-intersection graphs
From MaRDI portal
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
Cites work
- Component evolution in a secure wireless sensor network
- Connectivity of the uniform random intersection graph
- Degree and clustering coefficient in sparse random intersection graphs
- Diameter, connectivity, and phase transition of the uniform random intersection graph
- On the strength of connectedness of a random graph
- Perfect matchings in random intersection graphs
- Random graphs.
- Zero–One Laws for Connectivity in Random Key Graphs
Cited in
(5)- On \(k\)-connectivity and minimum vertex degree in random \(s\)-intersection graphs
- Perfect matchings in random intersection graphs
- 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)