The closure of the set of roots of strongly connected reliability polynomials is the entire complex plane
type: Item
instance of: scholarly article
title: The closure of the set of roots of strongly connected reliability polynomials is the entire complex plane
zbMATH Open document ID: 1198.05076
author: Jason I. Brown
author: D. Cox
published in: Discrete Mathematics
publication date: 2009-12-15T00:00:00Z
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C40
zbMATH DE Number: 5648045
zbMATH Keywords: strongly connected reliability
zbMATH Keywords: digraph
zbMATH Keywords: roots
zbMATH Keywords: closure
MaRDI profile type: Publication
full work available at URL: j.disc.2009.03.012
OpenAlex ID: W2058654435
cites work: Q3932822
cites work: Roots of the Reliability Polynomials
cites work: On the roots of strongly connected reliability polynomials
cites work: The strongly connected reliability of complete digraphs
cites work: Uniformly optimal digraphs for strongly connected reliability
cites work: Reliability polynomials and their asymptotic limits for families of graphs
cites work: Homogeneous multivariate polynomials with the half-plane property
cites work: Q4888903
cites work: Random matrices and graphs
cites work: Survival reliability of some double-loop networks and chordal rings
cites work: Exact reliabilities of most reliable double-loop networks
cites work: The Brown-Colbourn conjecture on zeros of reliability polynomials is false
cites work: Zeros of Reliability Polynomials and f-vectors of Matroids
DOI: 10.1016/J.DISC.2009.03.012
description: scientific article; zbMATH DE number 5648045