Open Access
| Issue |
RAIRO-Oper. Res.
Volume 59, Number 4, July-August 2025
|
|
|---|---|---|
| Page(s) | 2279 - 2301 | |
| DOI | https://doi.org/10.1051/ro/2025085 | |
| Published online | 05 September 2025 | |
- M. Arockiaraj, P. Manuel, I. Rajasingh and B. Rajan, Wirelength of 1-fault Hamiltonian graphs into wheels and fans. Inf. Process. Lett. 111 (2011) 921–925. [Google Scholar]
- M. Arockiaraj, J. Delaila and J. Abraham, Optimal wirelength of balanced complete multipartite graphs onto cartesian product of path, cycle and trees. Fund. Inf. 178 (2021) 187–202. [Google Scholar]
- S. Bezrukov, Edge isoperimetric problems on graphs, Graph theory and combinatorial biology. Bolyai Soc. Math. Stud. 7 (1999) 157–197. [Google Scholar]
- S. Bezrukov, J. Chavez, L. Harper, M. Rotteger and U. Schroeder, Embedding of hypercube into grids. Math. Found. Comput. Sci. 1450 (1998) 693–701. [Google Scholar]
- W. Chen, H. Lu and Y. Yeh, Operations of interlaced trees and graceful trees. Southeast Asian Bull. Math. 21 (1997) 337–348. [Google Scholar]
- S. Choudum and I. Raman, Embedding height balanced trees and Fibonacci trees in hypercubes. J. Appl. Math. Comput. 30 (2009) 39–52. [Google Scholar]
- W. Fan, J. Fan, C. Lin, Z. Han, P. Li and R. Wang, Embedding exchanged hypercubes into rings and ladders, in International Conference on Algorithms and Architectures for Parallel Processing. Vol. 15 (2018) 3–17. [Google Scholar]
- M.R. Garey and D.S. Johnson, Computers and Intractability: a guide to the theory of NP-Completeness. Freeman, San Francisco, California (1979). [Google Scholar]
- L. Harper, Optimal assignments of numbers to vertices. Soc. Ind. Appl. Math. 12 (1964) 131–135. [Google Scholar]
- L. Harper, Global Methods for Combinatorial Isoperimetric Problems. Vol. 90. Cambridge University Press (2006). [Google Scholar]
- L.H. Harper, Can the Sierpinski graph be embedded in the Hamming graph? Preprint arXiv:1609.06777 (2016). [Google Scholar]
- L. Harper, The edge-isoperimetric problem on sierpinski graph: final resolution. Preprint arXiv:1802.08355 (2018). [Google Scholar]
- A.M. Hinz, S. Klavžar and S.S. Zemljič, A survey and classification of Sierpinski-type graphs. Discrete Appl. Math. 217 (2017) 565–600. [CrossRef] [MathSciNet] [Google Scholar]
- S. Klavžar, Coloring Sierpinski network and Sierpinski gasket graphs. Taiwanese J. Math. 12 (2008) 513–522. [CrossRef] [MathSciNet] [Google Scholar]
- S. Klavžar and U. Milutinoviá, Graphs S(n, k) and a variant of the tower of Hanoi problem. Czechoslovak Math. J. 47 (1997) 95–104. [Google Scholar]
- S. Klavžar and B. Mohar, Crossing numbers of Sierpinski-like graphs. J. Graph Theory 50 (2005) 186–198. [Google Scholar]
- P. Manuel, I. Rajasingh, B. Rajan and H. Mercy, Exact wirelength of hypercubes on a grid. Discrete Appl. Math. 157 (2009) 486–1495. [Google Scholar]
- P. Manuel, M. Arockiaraj, I. Rajasingh and B. Rajan, Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength. Discrete Appl. Math. 159 (2011) 2109–2116. [Google Scholar]
- N. Parthiban, J. Ryan, I. Rajasingh, R. Rajan and L. Rani, Exact wirelength of embedding chord graph into tree-based architectures. Int. J. Netw. Virtual Org. 17 (2017) 76–87. [Google Scholar]
- R.S. Rajan, P. Manuel, I. Rajasingh, N. Parthiban and M. Miller, A lower bound for dilation of an embedding. Comput. J. 58 (2015) 3271–3278. [Google Scholar]
- R. Rajan, N. Parthiban, I. Rajasingh and M. Miller, Minimum linear arrangement of incomplete hypercubes. Comput. J. 58 (2015) 331–337. [Google Scholar]
- R. Rajan, T. Rajalaxmi, J. Liu and G. Sethuraman, Wirelength of embedding complete multipartite graphs into certain graphs. Discrete Appl. Math. 280 (2020) 221–236. [Google Scholar]
- R. Rajan, A. Greeni and P. Joshwa, Maximum subgraph problem and minimum linear arrangement of generalized sierpinski networks. J. Graph Algorithms App. 27 (2023) 767–782. [Google Scholar]
- R. Rajan, R. Reji and T. Rajalaxmi, Maximum subgraph problem for 3-regular Knödel graphs and its wirelength, in Conference on Algorithms and Discrete Applied Mathematics (2023) 403–414. [Google Scholar]
- R. Rajan, D. Dominic and N. Sadagopan, Optimal layout of (Kp − Cp) into wheel-like networks. J. Interconnection Netw. 27 (2024) 2450007. [Google Scholar]
- R. Rajan, R. Reji, N. Sadagopan and N.C. Ismail, Embedding of hypercube into fractal cubic network. Parallel Process. Lett. 34 (2024) 2450008. [Google Scholar]
- I. Rajasingh and M. Arockiaraj, Linear wirelength of folded hypercubes. Math. Comput. Sci. 5 (2011) 101–111. [Google Scholar]
- I. Rajasingh, P. Manuel, M. Arockiaraj and B. Rajan, Embeddings of circulant networks. J. Comb. Optim. 26 (2013) 135–151. [Google Scholar]
- I. Rajasingh, R. Rajan and P. Manuel, A linear time algorithm for embedding christmas trees into certain trees. Parallel Process. Lett. 25 (2015) 1550008. [Google Scholar]
- S. Rajeshwari and M. Rajesh, Exact wirelength of embedding 3-ary n-cubes into certain cylinders and trees. Fund. Inf. 188 (2023). [Google Scholar]
- R. Reji, R. Rajan and T. Rajalaxmi, Embedding Knodel graph into cube-like architectures: dilation optimization and wirelength analysis. J. Interconnection Netw. 24 (2024) 2350031. [Google Scholar]
- J. Xu, Topological Structure and Analysis of Interconnection Networks. Vol. 7. Springer Science & Business Media (2013). [Google Scholar]
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.