Journal of Combinatorial Optimization

, Volume 38, Issue 4, pp 1180–1195 | Cite as

Node set optimization problem for complete Josephus cubes

  • Micheal Arockiaraj
  • Jessie AbrahamEmail author
  • Arul Jeya Shalini


The problem of finding an optimal node set in an interconnection network plays an important role in minimizing the layout of embedding the network into linear chassis. In this paper we find the nested optimal node sets for a complete Josephus cube, a recently proposed fault-tolerant node cluster architecture variant of the binary hypercube which has the same number of nodes as the hypercube but exhibits enhanced embedding, fault tolerance and communications performance than the hypercube and many of its variants. As a byproduct we obtain the minimum layout of embedding the complete Josephus cube into a path, 1-rooted complete binary tree, sibling tree and caterpillar.


Embedding Complete Josephus cube Optimal set Layout 



This work was supported by Loyola College - Times of India, Chennai, India [Project No. 5LCTOI14MAT002].


  1. Adolphson AD (1977) Single machine job sequencing with precedence constraints. SIAM J Comput 6(1):40–54MathSciNetzbMATHGoogle Scholar
  2. Arockiaraj M, Manuel P, Rajasingh I, Rajan B (2011) Wirelength of \(1\)-fault hamiltonian graphs into wheels and fans. Inf Process Lett 111:921–925MathSciNetzbMATHGoogle Scholar
  3. Arockiaraj M, Abraham J, Quadras J, Shalini AJ (2015a) Linear layout of locally twisted cubes. Int J Comput Math 94:56–65. MathSciNetzbMATHGoogle Scholar
  4. Arockiaraj M, Quadras J, Rajasingh I, Shalini AJ (2015b) Embedding hypercubes and folded hypercubes onto cartesian product of certain trees. Discrete Optim 17:1–13MathSciNetzbMATHGoogle Scholar
  5. Arockiaraj M, Liu J-B, Shalini AJ (2019) Vertex decomposition methodfor wirelength problem and its applications to enhanced hypercube networks. IET Comput Digit Tec 13(2):87–92Google Scholar
  6. Bezrukov SL, Chavez JD, Harper LH, Röttger M, Schroeder U-P (1998) Embedding of hypercubes into grids. In: Proceedings of the 23rd international symposium on mathematical foundations of computer science. Springer, pp 693–701Google Scholar
  7. Bezrukov SL, Chavez JD, Harper LH, Röttger M, Schroeder U-P (2000a) The congestion of \(n\)-cube layout on a rectangular grid. Discrete Math 213(1):13–19MathSciNetzbMATHGoogle Scholar
  8. Bezrukov SL, Das SK, Elsässer R (2000b) An edge-isoperimetric problem for powers of the Petersen graph. Ann Comb 4(2):153–169MathSciNetzbMATHGoogle Scholar
  9. Boals AJ, Gupta AK, Sherwani NA (1994) Incomplete hypercubes: algorithms and embeddings. J Supercomput 8(3):263–294Google Scholar
  10. Chen PPS (1976) The entity-relationship model-toward a unified view of data. ACM Trans Database Syst 1(1):9–36MathSciNetGoogle Scholar
  11. Chen H-L, Tzeng N-F (1997) A boolean expression-based approach for maximum incomplete subcube identification in faulty hypercubes. IEEE Trans Parallel Distrib Syst 8(11):1171–1183Google Scholar
  12. Cormen TH, Leiserson CE, Rivest RL, Stein C (2001) Introduction to algorithms. MIT Press and McGraw-Hill, New YorkzbMATHGoogle Scholar
  13. Diaz J, Petit J, Serna M (2002) A survey of graph layout problems. Comput Surv 34(3):313–56Google Scholar
  14. Gane C, Sarson T (1977) Structured systems analysis: tools and techniques, 1st edn. McDonnell Douglas Systems Integration Company, PlanoGoogle Scholar
  15. Harper LH (1964) Optimal assignments of numbers to vertices. SIAM J Appl Math 12(1):131–135MathSciNetzbMATHGoogle Scholar
  16. Harper LH (2004) Global methods for combinatorial isoperimetric problems. Cambridge University Press, CambridgezbMATHGoogle Scholar
  17. Karp RM (1993) Mapping the genome: some combinatorial problems arising in molecular biology. In: Proceedings of the twenty-fifth annual ACM symposium on theory of computing, New York, NY, USA, pp 278–285Google Scholar
  18. Lai Y-L, Williams K (1999) A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs. J Graph Theory 31(2):75–94MathSciNetzbMATHGoogle Scholar
  19. Loh PKK, Hsu WJ (1998) The Josephus cube: a large family of hypercubic interconnection networks. In: Proceedings of the 2nd international conference on parallel and distributed computing and networks, Brisbane, Australia, pp 176–181Google Scholar
  20. Loh PKK, Hsu WJ (2000) The Josephus cube: a novel interconnection network. Parallel Comput 26(4):427–453MathSciNetzbMATHGoogle Scholar
  21. Loh PKK, Hsu WJ (2003) Fault-tolerance of complete Josephus cubes. J Syst Archit 49(1):1–21Google Scholar
  22. Loh PKK, Hsu WJ (2004) Fault-tolerant routing for complete Josephus cubes. Parallel Comput 30(9–10):1151–1167Google Scholar
  23. Louri A, Sung H (1994) An optical multi-mesh hypercube: a scalable optical interconnection network for massively parallel computing. J Lightw Technol 12(4):70–716Google Scholar
  24. Louri A, Weech B, Neocleous C (1998) A spanning multichannel linked hypercube: a gradually scalable optical interconnection network for massively parallel computing. IEEE Trans Parallel Distrib Syst 9(5):497–512Google Scholar
  25. Lu L, Zhou S (2013) Conditional diagnosability of complete Josephus cubes. In: Network and parallel computing, lecture notes in computer science. Springer, Berlin, pp 220–231Google Scholar
  26. Manuel P (2011) Minimum average congestion of enhanced and augmented hypercubes into complete binary trees. Discrete Appl Math 159:360–366MathSciNetzbMATHGoogle Scholar
  27. Manuel P, Rajasingh I, Rajan B, Mercy H (2009) Exact wirelength of hypercubes on a grid. Discrete Appl Math 157(7):1486–1495MathSciNetzbMATHGoogle Scholar
  28. Manuel P, Arockiaraj M, Rajasingh I, Rajan B (2011) Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength. Discrete Appl Math 159(17):2109–2116MathSciNetzbMATHGoogle Scholar
  29. Mitchison G, Durbin R (1986) Optimal numberings of an \(n \times n\) array. SIAM J Discrete Math 7(4):571–582MathSciNetzbMATHGoogle Scholar
  30. Pardo EG, Soto M, Thraves C (2015) Embedding signed graphs in the line. J Comb Optim 29(2):451–471MathSciNetzbMATHGoogle Scholar
  31. Quadras J, Solomon SS (2015) Embedding of the folded hypercubes into tori. Math Comput Sci 9(2):177–183MathSciNetzbMATHGoogle Scholar
  32. Rajasingh I, Arockiaraj M (2011) Linear wirelength of folded hypercubes. Math Comput Sci 5(1):101–111MathSciNetzbMATHGoogle Scholar
  33. Rajasingh I, Arockiaraj M, Rajan B, Manuel P (2012a) Minimum wirelength of hypercubes into \(n\)-dimensional grid networks. Inf Process Lett 112(14–15):583–586MathSciNetzbMATHGoogle Scholar
  34. Rajasingh I, Rajan B, Rajan RS (2012b) Embedding of hypercubes into necklace, windmill and snake graphs. Inf Process Lett 112:509–515MathSciNetzbMATHGoogle Scholar
  35. Rajasingh I, Manuel P, Arockiaraj M, Rajan B (2013) Embedding of circulant networks. J Comb Optim 26(1):135–151MathSciNetzbMATHGoogle Scholar
  36. Ravi R, Agrawal A, Klein P (1991) Ordering problems approximated: single-processor scheduling and interval graphs connection. In: Proceedings of the 18th international colloquium on automata. Languages and programming. Springer, New York, pp 751–762Google Scholar
  37. Tzeng NF, Wei S (1991) Enhanced hypercubes. IEEE Trans Comput 40(3):284–294Google Scholar
  38. Vannelli A, Rowan GS (1986) An eigen vector based approach for multistack VLSI layout. In: Proceedings of 29th midwest symposium on circuits and systems, North-Holland, New York, pp 435–439Google Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2019

Authors and Affiliations

  • Micheal Arockiaraj
    • 1
  • Jessie Abraham
    • 2
    Email author
  • Arul Jeya Shalini
    • 3
  1. 1.Department of MathematicsLoyola CollegeChennaiIndia
  2. 2.Department of MathematicsKCG College of TechnologyChennaiIndia
  3. 3.Department of MathematicsWomen’s Christian CollegeChennaiIndia

Personalised recommendations