Judgment Criteria for Reliability Comparison of Three-Terminal Graphs with High Edge Failure Probability
A three-terminal graph is defined as a simple graph comprising three specified target vertices. The reliability of three-terminal graphs represents the probability that these three target vertices remain connected, given that each edge fails independently with a constant probability <i>q</i...
Saved in:
| Main Authors: | Sun Xie, Haixing Zhao, Jun Yin, Jinyu Zou |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-06-01
|
| Series: | Axioms |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2075-1680/14/6/457 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Reliability test for frequency estimation of sinusoid based on LMP detection
by: UGuo-bing H, et al.
Published: (2015-05-01) -
The Reliability of a Class of Two-Layer Networks with Unreliable Edges
by: Sun Xie, et al.
Published: (2024-11-01) -
Reliable and Faithful Generative Explainers for Graph Neural Networks
by: Yiqiao Li, et al.
Published: (2024-12-01) -
Application of the algorithm for finding the outer median of a graph in the problems of determining the reliability of technical systems
by: Yuri A. Plaksa, et al.
Published: (2023-09-01) -
When one graph judgment leads to another: Signal detection analysis of base rate effects
by: Ethan C. Guthrie, et al.
Published: (2025-01-01)