Exploring connectivity of random subgraphs of a graph
Behrang Mahjani
TL;DR
This paper investigates the connectivity properties of random subgraphs formed from Cartesian products of small graphs and reviews existing results on network reliability, providing insights into graph connectivity and network robustness.
Contribution
It offers new analysis of connectivity in random subgraphs of specific graph products and summarizes key findings in network reliability research.
Findings
Connectivity thresholds identified for certain graph products
Summary of key network reliability results
Insights into the robustness of network structures
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 , , and . In the second part, the author presents a short review of the results about network reliability.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Theory Research · Limits and Structures in Graph Theory · Graph theory and applications