Open Access
Research Article·pp. 2321–2332·Vol. 29, Issue 6Jun 2026
Maximum subgraph and wirelength analysis of extended Sierpiński graph S+(n, K3)
P. Leo Joshwa, R. Sundara Rajan, D. Ahima Emilet, S. Arulanand
Published Online: 20 Jun 2026DOI: 10.47974/JDMSC-2577
In this paper: The Sierpiński graph S(n, Km), known for its recursive and hierarchical construction, serves as a significant model for multiprocessor interconnection architectures. Its extended variant, denoted S+ (...
