Nonexistence of uniformly most reliable graphs of least corank
Authors:
- Pablo RomeroPRPablo Romero
- Martín D. SafeMSMartín D. Safe
- 27 October 2025
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 380, 407-419
Abstract
No abstract availableAll Related Versions
Funding Information
- CONICET (PIBAA 28720210101185CO)
- Universidad Nacional del Sur (PGI 24/L115)
- Universidad Nacional del Sur (24/L115)
- Comisión Sectorial de Investigación Científica
- Agencia Nacional de Promoción Científica y Tecnológica (Grant01-PICT 2022-2022-03-00704)
- Agencia Nacional de Promoción Científica y Tecnológica (01-PICT 2022-2022-03-00704)
- Agencia Nacional de Investigación e Innovación
This publication has 12 references indexed in Scilit:
- Classes of uniformly most reliable graphs for all-terminal reliabilityDiscrete Applied Mathematics, 2019
- Nonexistence of optimal graphs for all terminal reliabilityNetworks, 2013
- The structure of max ?-minm?+1 graphs used in the design of reliable networksNetworks, 1997
- 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
- Combinatorial optimization problems in the analysis and design of probabilistic networksNetworks, 1985
- On graphs with randomly deleted edgesActa Mathematica Hungarica, 1981
- Cubic graphs on ≤14 verticesJournal of Combinatorial Theory, Series B, 1977