Embedding of hypercubes into necklace, windmill and snake graphs

Authors:
Indra Rajasingh;Bharati Rajan;R. Sundara Rajan
Affiliations:
Department of Mathematics, Loyola College, Chennai 600 034, India;Department of Mathematics, Loyola College, Chennai 600 034, India;Department of Mathematics, Loyola College, Chennai 600 034, India
Venue:
Information Processing Letters
Year:
2012

Citing 28
Cited 0

Incomplete Hypercubes

IEEE Transactions on Computers
Incomplete hypercubes: algorithms and embeddings

The Journal of Supercomputing
On embedding binary trees into hypercubes

Journal of Parallel and Distributed Computing
A Boolean Expression-Based Approach for Maximum Incomplete Subcube Identification in Faulty Hypercubes

IEEE Transactions on Parallel and Distributed Systems
The cyclic cutwidth of trees

Discrete Applied Mathematics
The congestion of n-cube layout on a rectangular grid

Discrete Mathematics - Special issue on Selected Topics in Discrete Mathematics conferences
Embeddings of complete binary trees into grids and extended grids with total vertex-congestion

Discrete Applied Mathematics
Efficient embeddings of grids into grids

Discrete Applied Mathematics - Special issue on international workshop of graph-theoretic concepts in computer science WG'98 conference selected papers
Optimal embeddings of generalized ladders into hypercubes

Discrete Mathematics
Embedding complete trees into the hypercube

Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Efficient embeddings of ternary trees into hypercubes

Journal of Parallel and Distributed Computing
The circular wirelength problem for hypercubes

The circular wirelength problem for hypercubes
Embedding of cycles and wheels into arbitrary trees

Networks
Dense sets and embedding binary trees into hypercubes

Discrete Applied Mathematics
Embedding meshes into crossed cubes

Information Sciences: an International Journal
A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs

Journal of Graph Theory
Embedding of meshes in Möbius cubes

Theoretical Computer Science
Exact wirelength of hypercubes on a grid

Discrete Applied Mathematics
Embedding the incomplete hypercube in books

Information Processing Letters
Embedding meshes/tori in faulty crossed cubes

Information Processing Letters
Embedding meshes into locally twisted cubes

Information Sciences: an International Journal
Embedding of tori and grids into twisted cubes

Theoretical Computer Science
Minimum average congestion of enhanced and augmented hypercubes into complete binary trees

Discrete Applied Mathematics
Topological Structure and Analysis of Interconnection Networks

Topological Structure and Analysis of Interconnection Networks
Wirelength of 1-fault hamiltonian graphs into wheels and fans

Information Processing Letters
Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength

Discrete Applied Mathematics
Complete path embeddings in crossed cubes

Information Sciences: an International Journal

Quantified Score

Hi-index	0.89

Visualization

Abstract

Graph embedding problems have gained importance in the field of interconnection networks for parallel computer architectures. In this paper, we determine the exact wirelength of embedding hypercubes into necklace, windmill and snake graphs.