Embeddings of circulant networks

Authors:
Indra Rajasingh;Paul Manuel;M. Arockiaraj;Bharati Rajan
Affiliations:
Department of Mathematics, Loyola College, Chennai, India 600 034;Department of Information Science, Kuwait University, Safat, Kuwait;Department of Mathematics, Loyola College, Chennai, India 600 034;Department of Mathematics, Loyola College, Chennai, India 600 034
Venue:
Journal of Combinatorial Optimization
Year:
2013

Citing 19
Cited 0

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
Introduction to algorithms

Introduction to algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Embedding of Hypercubes into Grids

MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Edge-isoperimetric problems for Cartesian powers of regular graphs

Theoretical Computer Science - Selected papers in honor of Lawrence Harper
Embedding of cycles and wheels into arbitrary trees

Networks
Optimal Embeddings of Paths with Various Lengths in Twisted Cubes

IEEE Transactions on Parallel and Distributed Systems
A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs

Journal of Graph Theory
Embedding of Cycles in Twisted Cubes with Edge-Pancyclic

Algorithmica
Exact wirelength of hypercubes on a grid

Discrete Applied Mathematics
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
Topological Structure and Analysis of Interconnection Networks

Topological Structure and Analysis of Interconnection Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we solve the edge isoperimetric problem for circulant networks and consider the problem of embedding circulant networks into various graphs such as arbitrary trees, cycles, certain multicyclic graphs and ladders to yield the minimum wirelength.