The Gross-Saccoman Conjecture is True

Consider a graph with perfect nodes but independent edge failures with identical probability ρ. The reliability is the connectedness probability of the random graph. A graph with n nodes and e edges is uniformly optimally reliable (UOR) if it has the greatest reliability among all graphs with the sa...

Full description

Bibliographic Details

Main Author:	Romero, Pablo (author)
Format:	article
Language:	English
Published:	2020
Subjects:	Graph Theory Uniformly optimally reliable graph Gross-Saccoman conjecture Network Reliability Optimization Multigraphs Ciencias Naturales y Exactas Matemáticas Matemática Aplicada
Online Access:	https://hdl.handle.net/20.500.12381/700
Tags:	Add Tag No Tags, Be the first to tag this record!