Hamiltonian graphs with minimum number of edges for fault-tolerant topologies

doi:10.1016/0020-0190(92)90192-X

Information Processing Letters

Volume 44, Issue 2, 19 November 1992, Pages 95-99

https://doi.org/10.1016/0020-0190(92)90192-X Get rights and content

Abstract

For some applications it may be necessary that a hamiltonian cycle be present in the connection topology of the processing elements. We propose a family of network topologies, each of which has a hamiltonian cycle in the fault-free situations as well as when there is a single node or link failure. The proposed topologies require minimum number of edges among all possible interconnection structures having the above properties.

References (4)

P.K. Srimani et al.
Properties of a class of trivalent network graphs and optimal routing
Comput. Math. Appl.
(1991)
W.E. Leland et al.
Dense trivalent graphs for processor interconnection
IEEE Trans. Comput.
(1982)

There are more references available in the full text version of this article.

Cited by (16)

Globally bi-3<sup>*</sup>-connected graphs
2009, Discrete Mathematics
A $k$ -container $C (x, y)$ in a graph $G = (V, E)$ is a set of $k$ internally node-disjoint paths between vertices $x$ and $y$ . A $k^{*}$ -container $C (x, y)$ of $G$ is a $k$ -container such that every vertex of $G$ is incident with a certain path in $C (x, y)$ . A bipartite graph $G = (B \cup W, E)$ is globally bi- $3^{*}$ -connected if there is a $3^{*}$ -container $C (x, y)$ between any pair of vertices ${x, y}$ with $x \in B$ and $y \in W$ . Furthermore, $G$ is hyper globally bi- $3^{*}$ -connected if it is globally bi- $3^{*}$ -connected and there exists a $3^{*}$ -container $C (x, y)$ in $G - {z}$ for any three different vertices $x, y$ , and $z$ of the same partite set of $G$ . A graph $G = (V, E)$ is 1-edge Hamiltonian if $G - e$ is Hamiltonian for any $e \in E$ . A bipartite graph $G = (B \cup W, E)$ is $1_{p}$ -Hamiltonian if $G - {x, y}$ is Hamiltonian for any pair of vertices ${x, y}$ with $x \in B$ and $y \in W$ . In this paper, we prove that every hyper globally bi- $3^{*}$ -connected graph is $1_{p}$ -Hamiltonian and every globally bi- $3^{*}$ -connected graph is 1-edge Hamiltonian. We present some examples of hyper globally bi- $3^{*}$ -connected graphs, some globally bi- $3^{*}$ -connected graphs that are not hyper globally bi- $3^{*}$ -connected, and some examples of 1-edge Hamiltonian bipartite graphs that are not globally bi- $3^{*}$ -connected.
Two construction schemes for cubic hamiltonian 1-node-hamiltonian graphs
2008, Mathematical and Computer Modelling
A hamiltonian graph $G = (V, E)$ is hamiltonian 1-node-hamiltonian if $G - v$ is hamiltonian for any $v \in V$ . An $n$ -node hamiltonian 1-node-hamiltonian graph $G$ is optimal if it contains the least number of edges among all $n$ -node hamiltonian 1-node-hamiltonian graphs. The study of optimal 1-node-hamiltonian graphs is motivated by the design of optimal fault-tolerant token rings in computer networks. It is known that every cubic hamiltonian 1-node-hamiltonian graph is optimal. In this paper, we propose two construction schemes for cubic hamiltonian 1-node-hamiltonian regular graphs.
Cubic planar hamiltonian graphs of various types
2006, Discrete Mathematics
Let U be the set of cubic planar hamiltonian graphs, A the set of graphs G in U such that $G - v$ is hamiltonian for any vertex $v$ of G, B the set of graphs G in U such that $G - e$ is hamiltonian for any edge e of G, and C the set of graphs G in U such that there is a hamiltonian path between any two different vertices of G. With the inclusion and/or exclusion of the sets $A, B$ , and C, U is divided into eight subsets. In this paper, we prove that there is an infinite number of graphs in each of the eight subsets.
Spider web networks: A family of optimal, fault tolerant, hamiltonian bipartite graphs
2005, Applied Mathematics and Computation
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) is a 3-regular bipartite planar graph with bipartition C and D. We prove that the honeycomb rectangular mesh HREM(m,n) is a spanning subgraph of SW(m,n). We also prove that SW(m,n)−e is hamiltonian for any e∈E and SW(m,n)−{c,d} remains hamiltonian for any c∈C and d∈D. These hamiltonian properties are optimal.
Brother trees: A family of optimal 1 <inf>p</inf>-hamiltonian and 1-edge hamiltonian graphs
2003, Information Processing Letters
Christmas tree: A versatile 1-fault-tolerant design for token rings
1999, Information Processing Letters
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 design for token rings is equivalent to design of $1$ -Hamiltonian graphs. This paper introduces a new family of graphs called Christmas tree, denoted by $CT(s)$ . The graph $CT(s)$ is a $3$ -regular, planar, $1$ -Hamiltonian, and Hamiltonian-connected graph. The number of nodes in $CT(s)$ is $3·2^{s} −2$ . Its diameter is $1$ if $s=1$ , 3 if $s=2$ , and $2s$ if $s≥3$ .

View all citing articles on Scopus

View full text

Hamiltonian graphs with minimum number of edges for fault-tolerant topologies

Abstract

Comput. Math. Appl.

Dense trivalent graphs for processor interconnection

IEEE Trans. Comput.