On the roots of the node reliability polynomial

DOI10.1002/net.21697zbMath1387.05116arXiv1607.08496OpenAlexW2503583255MaRDI QIDQ4639686

L. A. S. Mól, Jason I. Brown

Publication date: 11 May 2018

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1607.08496

zbMATH Keywords

polynomial rootgraph polynomialall-terminal reliabilitynode reliabilityclosure of rootslimit of roots

Mathematics Subject Classification ID

Graph polynomials (05C31) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Related Items

Sixty years of network reliability, The node cop‐win reliability of unicyclic and bicyclic graphs, Network reliability: Heading out on the highway, Reliability polynomials of consecutive‐k‐out‐of‐n:Fsystems have unbounded roots, On the roots of the subtree polynomial, On the Mean Connected Induced Subgraph Order of Cographs