![Loading...](https://link.springer.com/static/c4a417b97a76cc2980e3c25e2271af3129e08bbe/images/pdf-preview/spacer.gif)
-
Article
Diagnosability for a family of matching composition networks
We study here the diagnosability of networks under two models of self-diagnosis: PMC model introduced by Preparata, Metze and Chien (IEEE Trans Electronic Computers 16(12):848–854 (1967)) and MM
-
Chapter and Conference Paper
A Tree Structure for Local Diagnosis in Multiprocessor Systems Under Comparison Model
If we only care about the status of a particular vertex, instead of doing global diagnosis, Hsu and Tan introduced the concept of local diagnosis and proposed an extended star structure to diagnose a vertex un...
-
Chapter and Conference Paper
A New Measure for Locally t-Diagnosable Under PMC Model
PMC model is the test-based diagnosis which a vertex performs the diagnosis by testing the neighbor vertices via the edges between them. Hsu and Tan proposed two structures to diagnose a vertex. But these stru...
-
Article
Graphs with Almost All Edges in Long Cycles
For an edge e of a given graph G, define \(c_e(G)\) ...
-
Article
On Cyclic Edge-Connectivity and Super-Cyclic Edge-Connectivity of Double-Orbit Graphs
A cyclic edge-cut of a graph G is an edge set, the removal of which separates two cycles. If G has a cyclic edge-cut, then it is said to be cyclically separable. For a cyclically separable graph G, the cyclic edg...
-
Chapter and Conference Paper
Fault-Tolerant Adaptive Routing in n-D Mesh
Utilizing mobile cloud computing has had numerous advantages such as the reduction of costs, development of efficiency, unlimited storage capacity, easy access to services at any time and from any location. It...