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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bhatt SN, Leighton FT (1984) A framework for solving VLSI graph layout problems. J Comput Syst Sci 28:300–343
Bezrukov SL (2001) Embedding complete trees into the hypercube. Discrete Appl Math 110:101–119
Bezrukov SL, Elsässer R (2003) Edge isoperimetric problem for Cartesian powers of regular graphs. Theor Comput Sci 307:473–492
Bezrukov SL, Chavez JD, Harper LH, Röttger M, Schroeder UP (1998) Embedding of hypercubes into grids. MFCS:693–701
Bezrukov SL, Chavez JD, Harper LH, Röttger M, Schroeder UP (2000a) The congestion of n-cube layout on a rectangular grid. Discrete Math 213:13–19
Bezrukov SL, Das SK, Elsässer R (2000b) An edge-isoperimetric problem for powers of the Petersen graph. Ann Comb 4:153–169
Caha R, Koubek V (2001) Optimal embeddings of generalized ladders into hypercubes. Discrete Math 233:65–83
Chavez JD, Trapp R (1998) The cyclic cutwidth of trees. Discrete Appl Math 87:25–32
Cormen TH, Leiserson CE, Rivest RL, Stein C (2001) Introduction to algorithms. MIT Press/McGraw-Hill, New York
Djidjev HN, Vrto I (2003) Crossing numbers and cutwidths. J Graph Algorithms Appl 7:245–251
Duffin RJ (1965) Topology of series—parallel networks. J Math Anal Appl 10:303–318
Fan J, Jia X, Lin X (2007) Optimal embeddings of paths with various lengths in twisted cubes. IEEE Trans Parallel Distrib Syst 18(4):511–521
Fan J, Jia X, Lin X (2008) Embedding of cycles in twisted cubes with edge-pancyclic. Algorithmica 51(3):264–282
Garey MR, Johnson DS (1979) Computers and intractability, a guide to the theory of NP-completeness. Freeman, San Francisco
Han Y, Fan J, Zhang S, Yang J, Qian P (2010) Embedding meshes into locally twisted cubes. Inf Sci 180(19):3794–3805
Harper LH (2004) Global methods for combinatorial isoperimetric problems. Cambridge University Press, Cambridge
Lai P-L, Tsai C-H (2010) Embedding of tori and grids into twisted cubes. Theor Comput Sci 411(40–42):3763–3773
Lai YL, Williams K (1999) A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs. J Graph Theory 31:75–94
Manuel P, Rajasingh I, Rajan B, Mercy H (2009) Exact wirelength of hypercube on a grid. Discrete Appl Math 157(7):1486–1495
Opatrny J, Sotteau D (2000) Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1. Discrete Appl Math 98:237–254
Quadras J (2005) Embeddings and interconnection networks. PhD dissertation, University of Madras, India
Rajasingh I, Quadras J, Manuel P, William A (2004) Embedding of cycles and wheels into arbitrary trees. Networks 44:173–178
Rottger M, Schroeder UP (2001) Efficient embeddings of grids into grids. Discrete Appl Math 108(1–2):143–173
Vodopivec A (2008) On embeddings of snarks in the torus. Discrete Math 308(10):1847–1849
Xu J-M (2001) Topological structure and analysis of interconnection networks. Kluwer Academic, Amsterdam
Yang M-C (2009) Path embedding in star graphs. Appl Math Comput 207(2):283–291
Yang X, Dong Q, Tang YY (2010) Embedding meshes/tori in faulty crossed cubes. Inf Process Lett 110(14–15):559–564
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Rajasingh, I., Manuel, P., Arockiaraj, M. et al. Embeddings of circulant networks. J Comb Optim 26, 135–151 (2013). https://doi.org/10.1007/s10878-011-9443-x
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-011-9443-x