Analysis of Graph covering polynomials for mesh networks
International Journal of Drug Delivery Technology · 03.07.2026 · 16 (61s)
DOI: 10.25258/ijddt.16.61s.6 ↗Kurz gefasst
Fachartikel in der Zeitschrift International Journal of Drug Delivery Technology, online erschienen am 03.07.2026. Verfasst von Shenbaga Priya und 1 weiteren Autor:innen.
Abstract (Originalsprache)
We present efficient algorithms for computing graph covering polynomials in mesh network topologies, addressing a critical gap in network reliability analysis. Mesh networks underpin parallel computing systems and data centers, yet their covering polynomial properties remain unexplored. We develop algorithms achieving O(n·4^m) time complexity for edge covering polynomials and O((mn)^3) for vertex covering polynomials in m × n meshes by exploiting bipartite structure. Main contributions include: (1) recursive formulas for 2 × n meshes with closed-form generating functions enabling O(n) computation, (2) dynamic programming for general meshes practical up to 6 × 6, (3) complete enumeration for meshes up to 5 × 5, and (4) exact reliability analysis achieving 15-20% accuracy improvement over Monte Carlo methods (98.7% experimental validation). Applications to data center design demonstrate practical significance for fault-tolerant systems requiring mission-critical reliability guarantees.
Zitieren
APA
Priya, S., & Govindan, V. (2026). Analysis of Graph covering polynomials for mesh networks. International Journal of Drug Delivery Technology, 16(61s). https://doi.org/10.25258/ijddt.16.61s.6
Vancouver
Priya S, Govindan V. Analysis of Graph covering polynomials for mesh networks. International Journal of Drug Delivery Technology. 2026;16(61s). doi:10.25258/ijddt.16.61s.6
BibTeX
@article{Priya2026,
author = {Priya, Shenbaga and Govindan, V.},
title = {Analysis of Graph covering polynomials for mesh networks},
journal = {International Journal of Drug Delivery Technology},
year = {2026},
volume = {16},
number = {61s},
doi = {10.25258/ijddt.16.61s.6}
}
EUVIMED