Due to recent developments of parallel and distributed computing, the design and analysis
of various interconnection networks has been a main topic of research for the past few years …

Suppose that G is a bipartite graph with its partite sets of equal size. G is said to be strongly
Hamiltonian‐laceable if there is a Hamiltonian path between every two vertices that belong …

Processor fault diagnosis has played an important role in measuring the reliability of a
multiprocessor system; the diagnosability of many well-known multiprocessor systems has …

The diagnosis of faulty processors plays an important role in multiprocessor systems for
reliable computing, and the diagnosability of many well-known networks has been explored …

The crossed cube, which is a variation of the hypercube, possesses some properties
superior to the hypercube. In this paper, assuming that each node is incident with at least …

A k-containerC (u, v) of a graph G is a set of k-disjoint paths joining u to v. A k-container C (u,
v) of G is ak*-container if it contains all the vertices of G. A graph G is k*-connected if there …

This paper derives the conditional node connectivity of the k-ary n-cube interconnection
network under the condition of forbidden faulty sets (ie assuming that each non-faulty …

In this paper, we aim to embed longest fault-free paths in an n-dimensional star graph with
edge faults. When n/spl ges/6 and there are n-3 edge faults, a longest fault-free path can be …

This article shows that, for any integers n and k with, at least vertices or edges have to be
removed from an n‐dimensional star graph to make it disconnected with no vertices of …

This paper considers a refined measure κ s (h) for the fault-tolerance of a network and, for
the generalized star network S n, k, determines κ s (h)(S n, k)= n+ h (k-2)-1 for 2⩽ k⩽ n-1 and …