In this paper, we have introduced few Interconnection Networks, called David Derived
Network DD (n), Dominating David Derived Network DDD (n), Honeycomb cup Network …

The minimum linear arrangement problem is a combinatorial optimization problem whose
goal is to find a linear layout of a network in such way that a certain objective cost function is …

One of the important features of an interconnection network is its ability to efficiently simulate
programs or parallel algorithms written for other architectures. Such a simulation problem …

Graph embeddings play a significant role in the design and analysis of parallel algorithms. It
is a map** of the topological structure of a guest graph G into a host graph H, which is …

A graph is cubical if it is a subgraph of a hypercube. For a cubical graph H and a hypercube
Q n, ex (Q n, H) is the largest number of edges in an H-free subgraph of Q n. If ex (Q n, H) is …

Embedding of hypercubes into necklace, windmill and snake graphs Page 1 Information
Processing Letters 112 (2012) 509–515 Contents lists available at SciVerse ScienceDirect …

Graph embedding is an important technique that maps a guest graph into a host graph,
usually an interconnection network. Many applications can be modeled as graph …

In the paper of Manuel et al.[10] the minimum wirelength of embedding hypercube into
cylinder was given as a conjecture. We show that Gray code embedding is an optimal …

Graph embedding has been known as a powerful tool for implementation of parallel
algorithms and simulation of interconnection networks. In this paper, we introduce a …

Interconnection networks, composed of numerous integrated circuits (ICs), form complex
structures crucial to many parallel computing systems. The effectiveness of very large scale …