Network reliability in hamiltonian graphs

View/ Open
Issue date
2021Suggested citation
Llagostera, Pol;
López Lorenzo, Ignacio;
Comas Rodríguez, Carles;
.
(2021)
.
Network reliability in hamiltonian graphs.
Discrete Optimization, 2021, vol. 41, 100645.
https://doi.org/10.1016/j.disopt.2021.100645.
Metadata
Show full item recordAbstract
The reliability polynomial of a graph gives the probability that a graph remains operational when all its edges could fail independently with a certain fixed probability. In general, the problem of finding uniformly most reliable graphs inside a family of graphs, that is, one graph whose reliability is at least as large as any
other graph inside the family, is very difficult. In this paper, we study this problem in the family of graphs containing a hamiltonian cycle.
Is part of
Discrete Optimization, 2021, vol. 41, 100645European research projects
Collections
The following license files are associated with this item: