The optimal unicyclic graphs for pair-connected reliability
From MaRDI portal
Publication:1208486
DOI10.1016/0166-218X(90)90057-JzbMath0773.05093MaRDI QIDQ1208486
Peter J. Slater, Ashok T. Amin, Kyle T. Siegrist
Publication date: 16 May 1993
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0166-218x(90)90057-j
90B25: Reliability, availability, maintenance, inspection in operations research
05C99: Graph theory
Related Items
Expected rank in antimatroids, Expected value expansions in rooted graphs, Distinguished vertices in probabilistic rooted graphs
Cites Work
- Unnamed Item
- The expected number of pairs of connected nodes: Pair-connected reliability
- Greedy Colourings of Steiner Triple Systems
- Uniformly-most reliable networks do not always exist
- On unreliability polynomials and graph connectivity in reliable network synthesis
- Maximizing the Mean Number of Communicating Vertex Pairs in Series-Parallel Networks
- Network Resilience
- On the nonexistence of uniformly optimal graphs for pair-connected reliability