Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On the nonexistence of uniformly optimal graphs for pair-connected reliability

From MaRDI portal
Publication:3971581
Jump to:navigation, search

DOI10.1002/net.3230210307zbMath0736.90034OpenAlexW1993655635MaRDI QIDQ3971581

Ashok T. Amin, Kyle T. Siegrist, Peter J. Slater

Publication date: 25 June 1992

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230210307


zbMATH Keywords

probabilistic graphspair-connectivity


Mathematics Subject Classification ID

Communication networks in operations research (90B18) Stochastic network models in operations research (90B15) Reliability, availability, maintenance, inspection in operations research (90B25)


Related Items (5)

Sixty years of network reliability ⋮ Network reliability: Heading out on the highway ⋮ The optimal unicyclic graphs for pair-connected reliability ⋮ The expected number of pairs of connected nodes: Pair-connected reliability ⋮ Cutting numbers for the forward loop backward hop network







This page was built for publication: On the nonexistence of uniformly optimal graphs for pair-connected reliability

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3971581&oldid=12002941"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 29 January 2024, at 23:22.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki