Hostname: page-component-cd9895bd7-gxg78 Total loading time: 0 Render date: 2024-12-26T08:24:14.706Z Has data issue: false hasContentIssue false
  • English
  • Français

COUNTEREXAMPLES TO CONJECTURES FOR UNIFORMLY OPTIMALLY RELIABLE GRAPHS

Published online by Cambridge University Press:  01 April 2000

Yontha Ath  and
Milton Sobel
Yontha Ath
Affiliation:
Department of Mathematics, Claremont Graduate University, Claremont, California 91711-6160, yath1@csulb.edu
Milton Sobel
Affiliation:
Department of Statistics and Applied Probability, University of California, Santa Barbara, Santa Barbara, California 94106, sobel@pstat.ucsb.edu
Get access Rights & Permissions [Opens in a new window]

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).

Type
Research Article
Information
Probability in the Engineering and Informational Sciences , Volume 14 , Issue 2 , April 2000 , pp. 173 - 177
Copyright
© 2000 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)