Optimal embedding of extended Sierpiński networks into windmill and necklace graphs
P. Leo Joshwajoseleowa18@gmail.comDepartment of MathematicsHindustan Institute of Technology & ScienceChennai, Tamil Nadu, 603103, India0000-0002-0365-2309View full profile → , *R. Sundara RajanCorresponding authorvprsundar@gmail.comDepartment of MathematicsRajalakshmi Engineering CollegeChennai, Tamil Nadu, 602105, India0000-0002-1851-6334View full profile → , T. M. Rajalaxmilaxmi.raji18@gmail.comDepartment of MathematicsSri Sivasubramaniya Nadar College of EngineeringChennai, Tamil Nadu, 603110, India0000-0001-9700-8110View full profile → , D. Ahima Emiletahi.180492@gmail.comDepartment of MathematicsHindustan Institute of Technology & ScienceChennai, Tamil Nadu, 603103, India0000-0002-3424-2126View full profile →
* Corresponding author · click or hover a name for details
- Received:
- 01 May 2025
- Published Online:
- 08 Apr 2026
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JDMSC-2394
- Pages:
- 1695–1706
Abstract
Keywords
Subject Classifications
References
[1] S. L. Bezrukov, “Edge isoperimetric problems on graphs,” in Graph Theory and Combinatorial Biology, vol. 7, pp. 157-197 (1999).
[2] A. Khobragade, R. Mahajan, H. Langi, R. Mundhe, and S. Ghumbre, “Effective negative triplet sampling for knowledge graph embedding,” Journal of Information and Optimization Sciences, vol. 43, no. 8, pp. 2075-2087 (2022).
[3] M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. San Francisco, CA, USA: Freeman (1979).
[4] R. S. Rajan, T. M. Rajalaxmi, J. B. Liu, and G. Sethuraman, “Wirelength of embedding complete multipartite graphs into certain graphs,” Discrete Applied Mathematics, vol. 280, pp. 221-236 (2020).
[5] P. L. Joshwa, R. S. Rajan, T. M. Rajalaxmi, and I. N. Cangul, “Embedding of extended Sierpiński network S++ (k,m) into certain trees,” RAIRO - Operations Research, vol. 59, no. 4, pp. 2279-2301 (2025).
[6] G. K. Nandini, S. Klavžar, T. M. Rajalaxmi, and R. S. Rajan, “A note on eccentricity based topological indices of honeycomb, oxide and 2-power interconnection networks,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 26, no. 7, pp. 231-253 (2021).
[7] S. Arulanand, R. S. Rajan, S. Prabhu, and S. Stephen, “Certain domination numbers for Cartesian product of graphs,” Journal of Discrete Mathematical Sciences and Cryptography, vol. 27, no. 3, pp. 1045-1058.
[8] P. Manuel, I. Rajasingh, B. Rajan, and H. Mercy, “Exact wirelength of hypercubes on a grid,” Discrete Applied Mathematics, vol. 157, no. 7, pp. 1486-1495 (2009).
[9] P. L. Joshwa, R. S. Rajan, and T. M. Rajalaxmi, “Maximum subgraph and wirelength optimization in cyclic bipartite networks Gk,3,” International Journal of Parallel, Emergent and Distributed Systems, pp. 1-21 (2026).
[10] R. S. Rajan, A. B. Greeni, and P. L. Joshwa, “Maximum subgraph problem and minimum linear arrangement of generalized Sierpiński networks,” Journal of Graph Algorithms and Applications, vol. 27, no. 9, pp. 767-782 (2023).
[11] P. L. Joshwa, R. S. Rajan, and T. M. Rajalaxmi, “Maximum subgraph and wirelength analysis of extended Sierpiński networks in parallel computing,” Discrete Applied Mathematics, vol. 383, pp. 367-382 (2026).
[12] S. Klavžar and B. Mohar, “Crossing numbers of Sierpiński-like graphs,” Journal of Graph Theory, vol. 50, no. 3, pp. 186-198 (2005).
[13] L. H. Harper, “The edge-isoperimetric problem on Sierpiński graph: Final resolution,” arXiv preprint arXiv:1802.08355 (2018).
[14] I. Rajasingh, B. Rajan, and R. S. Rajan, “Embedding of hypercubes into necklace, windmill and snake graphs,” Information Processing Letters, vol. 112, no. 12, pp. 509-515 (2012).
