The advancement of large scale integrated circuit technology has enabled the construction
of complex interconnection networks. Graph theory provides a fundamental tool for …

Актуальность исследования. Надежность является важнейшим аспектом при
использовании вычислительных систем в критических областях. Авиация, энергетика …

In this paper, we propose a honeycomb mesh variation, called a spider web network.
Assume that m and n are positive even integers with m⩾ 4. A spider web network SW (m, n) …

A graph G is a combined k-fault-tolerant Hamiltonian graph (also called a combined k-
Hamiltonian graph) if G− F is Hamiltonian for every subset F⊂(V (G)∪ E (G)) with| F|= k. A …

Optimal 1 -hamiltonian graphs 1 Page 1 ELSEVIER Information Processing Letters 65 (1998)
157-161 Optimal 1 -hamiltonian graphs 1 Jeng-Jung Wang, Chun-Nan Hung, Lih-Hsing Hsu …

The token ring topology is required in token passing approach used in distributed operating
systems. Fault tolerance is also required in the designs of distributed systems. Note that 1 …

Fault-tolerant multiprocessors are widely used in on-line transaction processing. Fault
tolerance is also desirable in massively parallel systems that have a relatively high failure …

Performance and fault tolerance are two major issues that need to be addressed while
designing highly available and reliable systems. The network topology or the notion of …

In this paper, we present three construction schemes for fault‐tolerant Hamiltonian graphs.
We show that applying these construction schemes on fault‐tolerant Hamiltonian graphs …

In this paper we propose a family of cubic bipartite planar graphs, brother trees, denoted by
BT (n) with n⩾ 2. Any BT (n) is hamiltonian. It remains hamiltonian if any edge is deleted …