Embedding of complete bipartite graphs into some special classes of chordal graphs
N. Jothilakshmijothi.jaya123@gmail.comDepartment of MathematicsHindustan Institute of Technology & ScienceChennai, Tamil Nadu, 603103, India0009-0003-8536-7417View full profile → , *R. Sundara RajanCorresponding authorvprsundar@gmail.comDepartment of MathematicsRajalakshmi Engineering CollegeChennai, Tamil Nadu, 602105, India0000-0002-1851-6334View full profile → , Indra Rajasinghindrarajasingh@yahoo.comDepartment of MathematicsSaveetha Engineering CollegeChennai, Tamil Nadu, 602105, India0000-0002-9721-9505View 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-2387
- Pages:
- 1661–1672
Abstract
Keywords
Subject Classifications
References
[1] 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. 1, pp. 231-253 (2023).
[2] R. S. Rajan, R. Dominic, and A. S. Fenovcikova, “ Wirelength of 3-regular Knodel graphs into certain graphs”, AIP Conference Proceedings, vol. 2797, pp. 020011 (2023).
[3] P Manuel, K Qureshi, A William, and A. Muthumalai, “ VLSI layout of Benes networks”, Journal of Discrete Mathematical Sciences and Cryptography, Vol. 10, no. 4, pp. 461-472 (2013).
[4] A. B. Greeni and I. Rajasingh, “ Embedding complete bipartite graph into grid with optimum congestion and wirelength”, International Journal of Networking and Virtual Organisations, vol. 17, no. 1, pp. 64-75 (2017).
[5] M. M. Legese, “ Steiner Wiener index of complete m-ary trees”, Iranian Journal of Mathematical Chemistry, vol. 12, no. 2, pp. 101-109 (2021).
[6] N. S. Narayanaswamy, N. Sadagopan, and A. Dubey, “ A note on contractible edges in chordal graphs”, arXiv : 0902.1364 (2009).
[7] 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).
[8] A. A. Shantrinal, R. S. Rajan, A. R. Babu, S. Anil, and M. A. Ahmed, “Embedding complete multipartite graphs into certain trees”, Journal of Combinatorial Mathematics and Combinatorial Computing, vol. 112, pp. 273-286 (2020).
[9] A. Olteanu, “The line graph of a tree and its edge ideal”, arXiv : 2108.03127 (2021).
[10] R. S. Rajan, A. A. Shantrinal, T. M. Rajalaxmi, J. Fan, and W. Fan, “Embedding complete multi-partite graphs into Cartesian product of paths and cycles”, Electronic Journal of Graph Theory and Applications, vol. 9, no. 2, pp. 507â-525 (2021).
[11] A. A. Shantrinal, S. Klavžar, R. S. Rajan, and T. M. Rajalaxmi, “An algorithm for embedding Turan graphs into incomplete hypercubes with minimum wirelength”, Journal of Graph Algorithms and Applications, vol. 25, no. 1, pp. 367-381 (2021).
[12] N. Cohen, D. Dimitrov, R. Krakovski, R. Skrekovski, and V. Vukasinovic, “On Wiener index of graphs and their line graphs”, MATCH Communications in Mathematical and in Computer Chemistry, vol. 64, pp. 683-698 (2010).
[13] P. Manuel, I. Rajasingh, B. Rajan, and H. Mercy, “Exact wirelength of hypercube on a grid”, Discrete Applied Mathematics, vol. 157, no. 7, pp. 1486-1495 (2009).
[14] I. Rajasingh, B. Rajan, and R. S. Rajan, “Exact embedding of hypercubes into necklace, windmill and snake”, Information Processing Letters, vol. 112, pp. 509-515 (2012).
[15] S. Mary and I. Rajasingh, “Embedding of circulant networks into wheels”, IOP Conference Series: Materials Science and Engineering, vol. 1012, pp. 012065 (2021).
[16] Z. Tang, “ Optimal embedding of hypercube into cylinder”, Theoretical Computer Science, vol. 923, pp. 327-336 (2022).
[17] R. S. Rajan, R. M. Reji, N. Sadagopan, and I. N. Cangul, “ Embedding of hypercube into fractal cubic network”, Parallel Processing Letters, vol. 34, no. 03n04, pp. 2450008 (2024).
[18] A. B. Greeni, R. S. Rajan, and P. Immanuel, “ Embedding augmented cube into certain trees and windmill Graphs”, International Journal of Foundations of Computer Science, vol. 35, no. 4, pp. 409-434 (2024).
[19] R. M. Reji and R. S. Rajan, “ Optimizing wirelength in embedding Turán graphs into complete binary trees”, Springer Proceedings in Mathematics and Statistics, vol. 480, pp. 3-10 (2025).
[20] J. Xu, Topological structures and analysis of interconnection networks, Kluwer Academic Publishers, Dordrecht (2001).
