Maximizing the Mean Number of Communicating Vertex Pairs in Series-Parallel Networks

DOI10.1109/TR.1986.4335425zbMath0599.90041MaRDI QIDQ3735418

Brent N. Clark, Charles J. Colbourn, Eric Neufeld

Publication date: 1986

Published in: IEEE Transactions on Reliability (Search for Journal in Brave)

zbMATH Keywords

network reliabilityall-terminal reliabilityprobabilistic graphmaximum mean number of communicating vertex pairsmost reliable networkseries-parallel undirected networks

Mathematics Subject Classification ID

Reliability, availability, maintenance, inspection in operations research (90B25)

Related Items (6)

Network Resilience ⋮ The optimal unicyclic graphs for pair-connected reliability ⋮ The Central Limit Theorem and the Law of Large Numbers for Pair-Connectivity in Bernoulli Trees ⋮ The expected number of pairs of connected nodes: Pair-connected reliability ⋮ Analysis and synthesis problems for network resilience ⋮ Cutting numbers for the forward loop backward hop network

This page was built for publication: Maximizing the Mean Number of Communicating Vertex Pairs in Series-Parallel Networks