Autor:	Llagostera, Pol, López, Nacho, Comas, Carles
Rok vydání:	2020
Předmět:	Mathematics - Combinatorics
Druh dokumentu:	Working Paper
Popis:	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.
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2005.02848 Zobrazit plný text záznamu View this record from Arxiv