Exploring connectivity of random subgraphs of a graph
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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.