论文标题
哈密顿图的网络可靠性
Network reliability in hamiltonian graphs
论文作者
论文摘要
图的可靠性多项式给出了一个概率，即当其所有边缘都能以一定的固定概率独立失败时，图形保持运行。通常，在图形系列中找到最可靠的图表的问题，即，一个图表的可靠性至少与家族内部的任何其他图一样大，这是非常困难的。在本文中，我们在包含哈密顿周期的图表系中研究了这个问题。
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.
