Reliability polynomial roots of simple graphs are dense in the unit disk, with real roots dense in [-1,0] union {1}.
[Col87] Charles J Colbourn.The Combinatorics of Network Reliability
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Density of reliability roots of simple graphs in the unit disk
Reliability polynomial roots of simple graphs are dense in the unit disk, with real roots dense in [-1,0] union {1}.