Classes of uniformly most reliable graphs for all-terminal reliability
- 12 June 2019
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 267, 12-29
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Nonexistence of optimal graphs for all terminal reliabilityNetworks, 2013
- SOME CONJECTURED UNIFORMLY OPTIMAL RELIABLE NETWORKSProbability in the Engineering and Informational Sciences, 2000
- On the characterization of graphs with maximum number of spanning treesDiscrete Mathematics, 1998
- A proof of Boesch's conjectureNetworks, 1994
- Uniformly‐most reliable networks do not always existNetworks, 1991
- On the existence of uniformly optimally reliable networksNetworks, 1991
- On unreliability polynomials and graph connectivity in reliable network synthesisJournal of Graph Theory, 1986
- On graphs with randomly deleted edgesActa Mathematica Hungarica, 1981