Skip to main content
SpringerLink
Log in

Embedding of Recursive Circulants into Certain Necklace Graphs

  • Published:
Mathematics in Computer Science Aims and scope Submit manuscript

Abstract

Graph embedding problems have gained importance in the field of interconnection networks for parallel computer architectures. Interconnection networks provide an effective mechanism for exchanging data between processors in a parallel computing system. In this paper, we embed recursive circulants into certain necklace graphs for minimizing the wirelength.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. Yang X., Dong Q., Tan Y.Y.: Embedding meshes/tori in faulty crossed cubes. Inf. Process Lett. 110(14–15), 559–564 (2010)

    Article  MATH  Google Scholar 

  2. Park J.-H., Chwa K.-Y.: Fundamental study: recursive circulants and their embeddings among hypercubes. Theor. Comput. Sci. 244(1–2), 35–62 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  3. Park, J.-H., Chwa, K.-Y.: Recursive circulant: a new topology for multicomputer networks (extended abstract). In: Proceedings internationsl symposium parallel architectures, algorithms and networks ISPAN’94, Kanazawa, Japan, December, pp 73–80 (1994)

  4. Lim H.-S., Park J.-H., Chwa K.-Y.: Embedding trees in recursive circulants. Discret. Appl. Math. 69(1–2), 83–99 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  5. Tsai C.-H., Tan J.J.M., Hsu L.-H.: The super-connected property of recursive circulant graphs. Inf. Process. Lett. 91(6), 293–298 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  6. Tsai C.H., Tan J.J.M., Chuang Y.C., Hsu L.H.: Hamiltonian properties of faulty recursive circulant graphs. J. Interconnect. Netw. 3(3–4), 273–289 (2002)

    Article  Google Scholar 

  7. Biss D.K.: Hamiltonian decomposition of recursive circulant graphs. Discret. Math. 214(1–3), 89–99 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  8. Fan J., Jia X., Lin X.: Complete path embeddings in crossed cubes. Inf. Sci. 176, 3332–3346 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  9. Chavez J.D., Trapp R.: The cyclic cutwidth of trees. Discret. Appl. Math. 87, 25–32 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  10. Guu, C.-J.: The circular wirelength problem for hypercubes. Ph.D. dissertation, University of California, Riverside (1997)

  11. Yang M.-C.: Path embedding in star graphs. Appl. Math. Comput. 207(2), 283–291 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  12. Rajasingh I., Quadras J., Manuel P., William A.: Embedding of cycles and wheels into arbitrary trees. Networks 44, 173–178 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  13. Manuel P.: Minimum average congestion of enhanced and augmented hypercube into complete binary tree. Discret. Appl. Math. 159(5), 360–366 (2010)

    Article  MathSciNet  Google Scholar 

  14. Rajasingh I., Manuel P., Arockiaraj M., Rajan B.: Embeddings of circulant networks. J. Combinat. Optim. 26(1), 135–151 (2013)

    Article  MATH  MathSciNet  Google Scholar 

  15. Manuel P., Arockiaraj M., Rajasingh I., Rajan B.: Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength. Discret. Appl. Math. 159(17), 2109–2116 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  16. Arockiaraj M., Manuel P., Rajasingh I., Rajan B.: Wirelength of 1-fault hamiltonian graphs into wheels and fans. Inf. Process. Lett. 111, 921–925 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  17. Rajasingh I., Rajan B., Rajan R.S.: Embedding of hypercubes into necklace, windmill and snake graphs. Inf. Process. Lett. 112, 509–515 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  18. Rajasingh, I., Rajan, R.S.: Exact wirelength of embedding circulant networks into necklace and windmill Graphs. Ars Combinatoria, (in press)

  19. Rajan, R.S., Rajasingh, I., Manuel, P., Rajalaxmi, T.M.: Exact wirelength of embedding recursive circulants into certain trees. (communicated)

  20. Bezrukov, S.L., Chavez, J.D., Harper, L.H., Röttger, M., Schroeder, U.P.: Embedding of hypercubes into grids. MFCS, pp 693–701 (1998)

  21. Bezrukov S.L., Chavez J.D., Harper L.H., Röttger M., Schroeder U.P.: The congestion of n-cube layout on a rectangular grid. Discret. Math. 213, 13–19 (2000)

    Article  MATH  Google Scholar 

  22. Manuel P., Rajasingh I., Rajan B., Mercy H.: Exact wirelength of hypercube on a grid. Discret. Appl. Math. 157(7), 1486–1495 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  23. Bezrukov S.L., Das S.K., Elsässer R.: An edge-isoperimetric problem for powers of the Petersen graph. Ann. Comb. 4, 153–169 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  24. Garey, M.R., Johnson, D.S.: Computers and intractability. A Guide to the theory of NP-Completeness, Freeman, San Francisco (1979)

  25. Harper L.H.: Global Methods for Combinatorial Isoperimetric Problems. Cambridge University Press, Cambridge (2004)

    Book  MATH  Google Scholar 

  26. Bermond J.C., Comellas F., Hsu D.F.: Distributed loop computer networks. A survey. J. Parallel Distrib. Comput. 24(1), 2–10 (1995)

    Article  Google Scholar 

  27. Rajasingh I., Rajan B., Rajan R.S.: Embedding of special classes of circulant networks, hypercubes and generalized Petersen graphs. Int. J. Computer Math. 89(15), 1970–1978 (2012)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Advanced Sciences, VIT University, Chennai, 600127, India

    R. Sundara Rajan

  2. School of Mathematical and Physical Sciences, The University of Newcastle, Callaghan, Australia

    R. Sundara Rajan

  3. School of Computing Science and Engineering, VIT University, Chennai, 600 127, India

    N. Parthiban

  4. Department of Mathematics, SSN College of Engineering, Chennai, 603110, India

    T. M. Rajalaxmi

Authors
  1. R. Sundara Rajan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. N. Parthiban
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. T. M. Rajalaxmi
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to R. Sundara Rajan.

Additional information

This work is supported by Endeavour Research Fellowship, No. BR14-003378, Australian Government, Australia.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Rajan, R.S., Parthiban, N. & Rajalaxmi, T.M. Embedding of Recursive Circulants into Certain Necklace Graphs. Math.Comput.Sci. 9, 253–263 (2015). https://doi.org/10.1007/s11786-015-0232-2

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11786-015-0232-2

Keywords

Mathematics Subject Classification

Search

Navigation