Uniformly most reliable three-terminal graph of dense graphs

DOI10.1155/2021/6664959zbMath1512.05243arXiv1912.11361OpenAlexW3155168585MaRDI QIDQ6331759

Hai-xing Zhao, Jun Yin, Sun Xie

Publication date: 23 December 2019

Full work available at URL: https://doi.org/10.1155/2021/6664959

Mathematics Subject Classification ID

Connectivity (05C40)

Cites Work

• Unnamed Item
• Two path extremal graphs and an application to a Ramsey-type problem
• Classes of uniformly most reliable graphs for all-terminal reliability
• SOME CONJECTURED UNIFORMLY OPTIMAL RELIABLE NETWORKS
• Uniformly-most reliable networks do not always exist
• A Linear-Time Algorithm for Computing K-Terminal Reliability in Series-Parallel Networks
• The Complexity of Enumeration and Reliability Problems
• On graphs with randomly deleted edges
• Uniformly optimally reliable graphs
• Nonexistence of optimal graphs for all terminal reliability
• On uniformly most reliable two‐terminal graphs
• On the existence of uniformly optimally reliable networks

This page was built for publication: Uniformly most reliable three-terminal graph of dense graphs