Abstract
In [7], several conjectures are listed
about uniformly most reliable graphs, and, to date, no
counterexamples have been found. These include the conjectures
that an optimal reliable graph has degrees that are almost
regular, has maximum girth, and has minimum diameter. In
this article, we consider simple graphs and present one
counterexample and another possible counterexample of these
conjectures: maximum girth (i.e., maximize the length of
the shortest circuit of the graph G) and minimum
diameter (i.e., minimize the maximum possible distance
between any pair of vertices).
Publisher
Cambridge University Press (CUP)
Subject
Industrial and Manufacturing Engineering,Management Science and Operations Research,Statistics, Probability and Uncertainty,Statistics and Probability
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献