SpletStar graphs are recognized as promising candidates for interconnection networks. This article addresses the size of a largest connected component of a faulty star graph. We … SpletThe fault diagnosis is the process of identifying faulty processors in a sys-tem through testing. In this paper, we show that the largest connected component of the survival …
Fault diagnosability of arrangement graphs - USTC
SpletLargest connected component of a star graph with faulty vertices Buy Article: $65.00 + tax (Refund Policy) Authors: Yang, Xiaofan 1; Megson, Graham 2; Tang, Yuan Yan 3; Xing, … Spletالرئيسية International Journal of Computer Mathematics Largest connected component of a star graph with faulty vertices International Journal of Computer Mathematics 2008 / 12 Vol. 85; Iss. 12 step ladders for working on stairs
Largest connected component of a star graph with faulty vertices
Splet29. jun. 2001 · An (n,k)-star graph is recently proposed as an attractive interconnection network topology and also known as the generalized version of an n-star graph with scalability such that the number of nodes in the graph can be suitably adjustable by two dimensioning parameters n and k. Splet20. maj 2024 · Li et al. established the relationship between extra connectivity and component connectivity in graphs with some conditions, and obtained the $(r+1)$ -component connectivity of some well-known networks such as complete cubic networks, generalized exchanged hypercubes, dual-cube-like networks and so on. SpletThe hierarchical star networks H S n, proposed by Shi and Srimani, is a new level interconnection network topology, and uses the star graphs as building blocks. In this paper, by exploring the combinatorial properties and fault-tolerance of H S n, we study the ℓ -component connectivity of hierarchical star networks H S n. step ladders with paint shelf