On the intersection graph of random caps on a sphere
From MaRDI portal
Recommendations
- The bound on Poisson approximation for the number of edges in a random intersection graph on the surface of a sphere
- A threshold for the size of random caps to cover a sphere
- When does the union of random spherical caps become connected?
- On a condition for the union of spherical caps to be connected
- On the isolated vertices and connectivity in random intersection graphs
Cites work
- scientific article; zbMATH DE number 3172297 (Why is no real title available?)
- scientific article; zbMATH DE number 3902655 (Why is no real title available?)
- scientific article; zbMATH DE number 17681 (Why is no real title available?)
- scientific article; zbMATH DE number 3594346 (Why is no real title available?)
- scientific article; zbMATH DE number 3625415 (Why is no real title available?)
- scientific article; zbMATH DE number 3106950 (Why is no real title available?)
- A threshold for the size of random caps to cover a sphere
- On a condition for the union of spherical caps to be connected
- The length of the shortest edge of a graph on a sphere
- The square of every two-connected graph is Hamiltonian
Cited in
(4)
This page was built for publication: On the intersection graph of random caps on a sphere
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1827342)