The $g$-good neighbor conditional diagnosability of locally exchanged twisted cubes
Huiqing Liu, Xiaolan Hu, Shan Gao

TL;DR
This paper investigates the fault tolerance of locally exchanged twisted cubes by determining their $g$-good neighbor conditional diagnosability and $R^g$-vertex-connectivity, providing new insights into their reliability under specific models.
Contribution
It introduces the $g$-good neighbor conditional diagnosability for locally exchanged twisted cubes and calculates these parameters under the PMC and MM* models, advancing understanding of their fault tolerance.
Findings
Determined the $R^g$-vertex-connectivity of $LeTQ(s,t)$.
Established the $g$-good neighbor conditional diagnosability under PMC and MM* models.
Provides theoretical bounds for fault tolerance in these network topologies.
Abstract
Connectivity and diagnosability are important parameters in measuring the fault tolerance and reliability of interconnection networks. The -vertex-connectivity of a connected graph is the minimum cardinality of a faulty set such that is disconnected and every fault-free vertex has at least fault-free neighbors. The -good-neighbor conditional diagnosability is defined as the maximum cardinality of a -good-neighbor conditional faulty set that the system can guarantee to identify. The interconnection network considered here is the locally exchanged twisted cube . For and , we first determine the -vertex-connectivity of , then establish the -good neighbor conditional diagnosability of under the PMC model and MM model, respectively.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsInterconnection Networks and Systems · Advanced Graph Theory Research · Graph theory and applications
