2023
DOI: 10.1002/net.22166
|View full text |Cite
|
Sign up to set email alerts
|

On the split reliability of graphs

Jason I. Brown,
Isaac McMullin

Abstract: A common model of robustness of a graph against random failures has all vertices operational, but the edges independently operational with probability p$$ p $$. One can ask for the probability that all vertices can communicate (all‐terminal reliability) or that two specific vertices (or terminals) can communicate with each other (two‐terminal reliability). A relatively new measure is split reliability, where for two fixed vertices s$$ s $$ and t$$ t $$, we consider the probability that every vertex communicate… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 8 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?