The optimal unicyclic graphs for pair-connected reliability
From MaRDI portal
Publication:1208486
DOI10.1016/0166-218X(90)90057-JzbMATH Open0773.05093OpenAlexW2050155662MaRDI QIDQ1208486FDOQ1208486
Authors: Kyle T. Siegrist, Ashok T. Amin, Peter Slater 
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
Recommendations
- On the nonexistence of uniformly optimal graphs for pair-connected reliability
- On uniformly optimally reliable graphs for pair‐connected reliability with vertex failures
- Uniformly optimal digraphs for strongly connected reliability
- scientific article; zbMATH DE number 5031207
- Uniformly optimally reliable graphs
- Uniformly optimally reliable graphs: A survey
- The node cop‐win reliability of unicyclic and bicyclic graphs
- Study on the uniformly optimally reliable graphs for given classes of graph
- Classes of uniformly most reliable graphs for all-terminal reliability
- scientific article; zbMATH DE number 5813
Reliability, availability, maintenance, inspection in operations research (90B25) Graph theory (05C99)
Cites Work
- On unreliability polynomials and graph connectivity in reliable network synthesis
- Uniformly-most reliable networks do not always exist
- Greedy Colourings of Steiner Triple Systems
- The expected number of pairs of connected nodes: Pair-connected reliability
- Network Resilience
- On the nonexistence of uniformly optimal graphs for pair-connected reliability
- Maximizing the Mean Number of Communicating Vertex Pairs in Series-Parallel Networks
- Title not available (Why is that?)
Cited In (6)
This page was built for publication: The optimal unicyclic graphs for pair-connected reliability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1208486)
