Exploring connectivity of random subgraphs of a graph

From MaRDI portal




Abstract: This work is divided into two main parts. The first part is devoted to exploring the connectivity of random subgraphs of cartesian products of K1, K2, and P3. In the second part, the author presents a short review of the results about network reliability.














This page was built for publication: Exploring connectivity of random subgraphs of a graph

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