On unreliability polynomials and graph connectivity in reliable network synthesis
From MaRDI portal
Publication:3478240
DOI10.1002/jgt.3190100311zbMath0699.90041MaRDI QIDQ3478240
No author found.
Publication date: 1986
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190100311
05C35: Extremal problems in graph theory
90B15: Stochastic network models in operations research
90B25: Reliability, availability, maintenance, inspection in operations research
Related Items
Optimally Reliable Graphs for Both Vertex and Edge Failures, Optimally reliable networks, The optimal unicyclic graphs for pair-connected reliability, The expected number of pairs of connected nodes: Pair-connected reliability, On reliable graphs with static routing plans, Number of minimum vertex cuts in transitive graphs