Maximum subgraph and wirelength analysis of extended Sierpiński graph S+(n, K3)
Journal of Discrete Mathematical Sciences & Cryptography · 2026 · 29 (6) · 2321-2332
DOI: 10.47974/jdmsc-2577 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Discrete Mathematical Sciences & Cryptography, 2026. Verfasst von P. Leo Joshwa und 3 weiteren Autor:innen.
Abstract (Originalsprache)
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+ (n, Km), further strengthens these properties and has practical relevance in areas such as parallel computation and VLSI circuit design. This work investigates the unresolved Maximum Subgraph Problem (MSP) for the extended Sierpiński graph S+ (n, K3), with n ≥ 2, a problem originally proposed by Joshwa et al. [1], and still open for general values of m. We introduce a computational framework, implemented in SageMath, for determining the maximal edge count among all subgraphs induced by r vertices, where 1 ≤ r ≤ 3n + 1. In addition, we examine minimum wirelength embeddings of S+(n, K3) into various hierarchical graph topologies, a key factor in optimizing communication efficiency and layout complexity in networked systems.
Zitieren
APA
Joshwa, P. L., Rajan, R. S., Emilet, D. A., & Arulanand, S. (2026). Maximum subgraph and wirelength analysis of extended Sierpiński graph S+(n, K3). Journal of Discrete Mathematical Sciences & Cryptography, 29(6), 2321-2332. https://doi.org/10.47974/jdmsc-2577
Vancouver
Joshwa PL, Rajan RS, Emilet DA, Arulanand S. Maximum subgraph and wirelength analysis of extended Sierpiński graph S+(n, K3). Journal of Discrete Mathematical Sciences & Cryptography. 2026;29(6):2321-2332. doi:10.47974/jdmsc-2577
BibTeX
@article{Joshwa2026,
author = {Joshwa, P. Leo and Rajan, R. Sundara and Emilet, D. Ahima and Arulanand, S.},
title = {Maximum subgraph and wirelength analysis of extended Sierpiński graph S+(n, K3)},
journal = {Journal of Discrete Mathematical Sciences & Cryptography},
year = {2026},
volume = {29},
number = {6},
pages = {2321--2332},
doi = {10.47974/jdmsc-2577}
}
EUVIMED