Given a graph whose edges never fail but whose nodes fail independently of each other with a constant probability 1 − − − p p p, the reliability of a graph is defined to be the probability that the induced subgraph of the surviving nodes is connected. Let Ω (n n n, m m m) be the class of all graphs with n n n nodes and m m m edges. A graph G of Ω is said to be uniformly best in Ω, if for all choices of p p p, it is most reliable in the class of graphs, Ω. In this paper, the existing known set of uniformly best graphs is extended, and some closely related graphs are proved to be not the uniformly best graphs in their class.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.