EUVIMEDEUVIMED entdecken
Crossref

Optimal embedding of extended Sierpiński networks into windmill and necklace graphs

P. Leo Joshwa, R. Sundara Rajan, T. M. Rajalaxmi, D. Ahima Emilet

Journal of Discrete Mathematical Sciences & Cryptography · 2026 · 29 (4) · 1695-1706

DOI: 10.47974/jdmsc-2394 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of Discrete Mathematical Sciences & Cryptography, 2026. Verfasst von P. Leo Joshwa und 3 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The Sierpińki network S(p, q) is a hierarchical, self-similar structure with broad applications in multiprocessor interconnection and VLSI design. In this work, we study its enhanced variant, S++ (p, q) for p ≥ 2, q ≥ 3, focusing on the problem of minimum wirelength embedding into windmill and necklace graphs. These results offer practical advances for hierarchical network layout, contributing to the design of scalable and low-latency parallel computing architectures.

Zitieren

APA

Joshwa, P. L., Rajan, R. S., Rajalaxmi, T. M., & Emilet, D. A. (2026). Optimal embedding of extended Sierpiński networks into windmill and necklace graphs. Journal of Discrete Mathematical Sciences & Cryptography, 29(4), 1695-1706. https://doi.org/10.47974/jdmsc-2394

Vancouver

Joshwa PL, Rajan RS, Rajalaxmi TM, Emilet DA. Optimal embedding of extended Sierpiński networks into windmill and necklace graphs. Journal of Discrete Mathematical Sciences & Cryptography. 2026;29(4):1695-1706. doi:10.47974/jdmsc-2394

BibTeX
@article{Joshwa2026,
  author = {Joshwa, P. Leo and Rajan, R. Sundara and Rajalaxmi, T. M. and Emilet, D. Ahima},
  title = {Optimal embedding of extended Sierpiński networks into windmill and necklace graphs},
  journal = {Journal of Discrete Mathematical Sciences & Cryptography},
  year = {2026},
  volume = {29},
  number = {4},
  pages = {1695--1706},
  doi = {10.47974/jdmsc-2394}
}
Kostenlos starten →