1. In multiprocessor systems, the systems always contain a large number of processors. Some processors may fail when a system is in put into use.
Dec 18, 2018 · The pessimistic diagnosability of graphs and its applications to four kinds of interconnection networks. Dongqin Cheng. Department of ...
Problems about embedding of disjoint paths in interconnection networks have received much attention in recent years. A connected graph G is strong Menger ...
The pessimistic diagnosability of graphs and its applications to four kinds of interconnection networks. by Dongqin Cheng. 2019, International Journal of ...
People also ask
What are the applications of graph theory in networking?
What is an interconnection network in graph theory?
What are the classification of interconnection networks?
What is the theory of graphs and networks?
The pessimistic diagnosabilities of some general regular graphs
www.sciencedirect.com › article › pii
The pessimistic diagnosability of a system G, denoted by t p ( G ) , is the maximal number of faulty processors so that the system G is t / t -diagnosable.
Jan 30, 2017 · In this paper, we study the pessimistic diagnosability of three kinds of graphs which are -arrangement graphs, -star graphs and balanced hypercubes.
The pessimistic diagnosability of graphs and its applications to four kinds of interconnection networks. ... Volume 4, Numbers 3-4, October 2019. view.
The pessimistic diagnosability of graphs and its applications to four kinds of interconnection networks · xml · Dongqin Cheng. Pages: 37-47. Published online: ...
In this article, we completely determine the pessimistic diagnosability of an n-dimensional alternating group graph, denoted by AG n . Furthermore, t p ( AG n ) ...
Missing: four | Show results with:four
The pessimistic diagnosability of graphs and its applications to four kinds of interconnection networks · Computer Science, Mathematics. Int. J. Comput. Math.