All Terminal Reliability Roots of Smallest Modulus

MaRDI QIDQ6320063zbMATH OpenFDO

Authors Jason I. Brown

Publication date 5 June 2019

Mathematics Subject Classification ID

Graph polynomials (05C31)

Abstract: Given a connected graph $G$ whose vertices are perfectly reliable and whose edges each fail independently with probability $qin[0,1],$ the extit{(all-terminal) reliability} of $G$ is the probability that the resulting subgraph of operational edges contains a spanning tree (this probability is always a polynomial in $q$). The location of the roots of reliability polynomials has been well studied, with particular interest in finding those with the largest moduli. In this paper, we will discuss a related problem -- among all reliability polynomials of graphs on $n$ vertices, which has a root of smallest modulus? We prove that, provided $ngeq3$, the roots of smallest moduli occur precisely for the cycle graph $C_n$, and the root is unique.

This page was built for publication: All Terminal Reliability Roots of Smallest Modulus

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6320063)