Exploring connectivity of random subgraphs of a graph

preprint2010arXivOpen access

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 K1K_1, K2K_2, and P3P_3. In the second part, the author presents a short review of the results about network reliability.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.