Many a time's assumptions are key to inventions. One such notion in recent past is about
data exchange between two disjoint computer systems. It is always assumed that, if any two …

Route redistribution (RR) has become an integral part of IP network design as the result of a
growing need for disseminating certain routes across routing protocol boundaries. While RR …

Current VLSI technology allows more than two wiring layers and the number is expected to
rise in future. In this paper we show that, by designing VLSI layouts directly for an L-layer …

Abstract Suppose that G (V0∪ V1, E) is a bipartite graph with partite sets of equal size. G is
called hyper hamiltonian laceable if (1) it has a hamiltonian path between any pair of …

Let Γ n be the symmetric group on {1, 2,…, n} and S be the generating set of Γ n. The
corresponding Cayley graph is denoted by Γ n (S). If all elements of S are transpositions, a …

We propose a new class of interconnection networks, called macro-star networks, which
belong to the class of Cayley graphs and use the star graph as a basic building module. A …

The presence of edge-disjoint Hamiltonian cycles provides an advantage when
implementing algorithms that require a ring structure by allowing message traffic to be …

Abstract A subset F⊂ V (G) is called an R k-vertex-cut if GF is disconnected and each vertex
u∈ V (G)-F has at least k neighbors in GF. The cardinality of a minimum R k-vertex-cut is the …

For a connected graph G=(V, E), a subset F⊆ V is called an R k-vertex-cut of G if G− F is
disconnected and each vertex in V− F has at least k neighbors in G− F. The cardinality of the …

In interconnection networks, data distribution and fault tolerance are crucial services. This
study proposes an effective algorithm for improving connections between networks …