Exploring connectivity of random subgraphs of a graph
classification
🧮 math.PR
keywords
connectivityexploringpartrandomsubgraphsauthorcartesiandevoted
read the original 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 $K_1$, $K_2$, and $P_3$. In the second part, the author presents a short review of the results about network reliability.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.