Embedding of complete bipartite graphs into some special classes of chordal graphs
Journal of Discrete Mathematical Sciences & Cryptography · 2026 · 29 (4) · 1661-1672
DOI: 10.47974/jdmsc-2387 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Discrete Mathematical Sciences & Cryptography, 2026. Verfasst von N. Jothilakshmi und 3 weiteren Autor:innen.
Abstract (Originalsprache)
The ability of one architecture to simulate another is the basis for comparing networks. Embedding is used to analyze these simulations. In architectural simulation, graph embedding is considered one of the most powerful applications for executing parallel algorithms and simulating various interconnection networks. In this work, we embed complete bipartite graphs into some special classes of chordal graphs and obtain its wirelength.
Zitieren
APA
Jothilakshmi, N., Rajan, R. S., Rajasingh, I., & Emilet, D. A. (2026). Embedding of complete bipartite graphs into some special classes of chordal graphs. Journal of Discrete Mathematical Sciences & Cryptography, 29(4), 1661-1672. https://doi.org/10.47974/jdmsc-2387
Vancouver
Jothilakshmi N, Rajan RS, Rajasingh I, Emilet DA. Embedding of complete bipartite graphs into some special classes of chordal graphs. Journal of Discrete Mathematical Sciences & Cryptography. 2026;29(4):1661-1672. doi:10.47974/jdmsc-2387
BibTeX
@article{Jothilakshmi2026,
author = {Jothilakshmi, N. and Rajan, R. Sundara and Rajasingh, Indra and Emilet, D. Ahima},
title = {Embedding of complete bipartite graphs into some special classes of chordal graphs},
journal = {Journal of Discrete Mathematical Sciences & Cryptography},
year = {2026},
volume = {29},
number = {4},
pages = {1661--1672},
doi = {10.47974/jdmsc-2387}
}
EUVIMED