Commentary on: reliability polynomials and link importance in networks

The author comments on the paper by L.B. Page et al., (see ibid., vol.43, p.51-8, 1994). The author considers the reliability of a communication network, represented by a graph G of nodes and edges (also called "links"); the nodes are assumed to be perfectly operational and the edges are assumed to be Y-independently operational with probability p. He points out the redundancy. The original author replies to the comment.