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 …

This paper addresses the challenge of recognizing behavior of groups of individuals in
unconstraint surveillance environments. As opposed to approaches that rely on …

Let T 1,< cd02144. gif>, T n be n spanning trees rooted at node r of graph G. If for any node
v, n paths from r to v, each path in each spanning tree of T 1,< cd02144. gif>, T n, are …

Given a node s and a set T= t1,…, tk of k nodes in a k-connected graph, the node-to-set
disjoint paths problem is to find k node-disjoint paths pi: s→ ti, 1⩽ i⩽ k. In this paper, we give …

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 …

We present a local clocking mechanism based on a tunable delay line which calibrates itself
from a low frequency global clock. After initial tuning, the local clock remains calibrated …

In this paper, we study the system diagnosis on an n-dimensional star under the comparison
model. Following the concept of local diagnosability [3], the strong local diagnosability …

It is well known that star graphs are strongly resilient like thencubes in the sense that they
are optimally fault tolerant and the fault diameter is increased only by one in the presence of …

An n‐dimensional hierarchical cubic network [denoted by HCN (n)] contains 2n n‐
dimensional hypercubes. The diameter of the HCN (n), which is equal to n+⌊(n+ 1)/3⌋+ 1, is …