Exploring connectivity of random subgraphs of a graph

2010/08/27 by Behrang Mahjani, Mahjani, Behrang
Mathematics · #FOS: Mathematics #Probability (math.PR) #math.PR

paper · pdf · doi:10.48550/arxiv.1008.4814

arxiv created 2010/08/27 · arxiv updated 2010/08/31

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₁, K₂, and P₃. In the second part, the author presents a short review of the results about network reliability.

Related

• Random graphs and their subgraphs
• Connectivity of the Uniform Random Intersection Graph
• Random Connection Hypergraphs
• Random Subgraphs in Sparse Graphs
• Connectivity of Large Scale Networks: Distribution of Isolated Nodes