| Autor: |
Sun Xie, Haixing Zhao, Liming Dai, Jun Yin |
| Jazyk: |
angličtina |
| Rok vydání: |
2021 |
| Předmět: |
|
| Zdroj: |
AIMS Mathematics, Vol 6, Iss 7, Pp 7518-7531 (2021) |
| Druh dokumentu: |
article |
| ISSN: |
2473-6988 |
| DOI: |
10.3934/math.2021439?viewType=HTML |
| Popis: |
A network structure with n vertices and m edges is practically represented by a graph with n vertices and m edges. The graph with k fixed target vertices is called a k-terminal graph. This article studies the locally most reliable simple sparse three-terminal graphs, in which each edge survives independently with probability p. For p close to 0 or 1, the locally most reliable three-terminal graphs with n vertices and m edges are determined, where n≥5 and 9≤m≤4n−10. Finally, we prove that there is no uniformly most reliable three-terminal graph for n≥5, 11 |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
