EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Fault-Tolerant Designs of Graphs with Gallai’s Property in Euclidean Space Tilings

Nazeer Muhammad, Yasir Bashir, Muhammad Faisal Nadeem, Aqsa Ehtram

Mathematical and Computational Applications · 12.06.2026 · 31 (3) · 106

DOI: 10.3390/mca31030106 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Mathematical and Computational Applications, online erschienen am 12.06.2026. Verfasst von Nazeer Muhammad und 3 weiteren Autor:innen. Die Arbeit nennt 24 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Abdullah Al Salem University, Kuwait.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

This study examines graphs that demonstrate Gallai’s property, particularly those in which for every prescribed set S of vertices with |S|=j there exists a longest path or cycle that avoids that set. Such graphs are naturally fault-tolerant in the structural sense: if some vertices fail, there can still exist longest routes that bypass the failed vertices. Our main purpose is to construct explicit Gallai-type graphs that admit embeddings into a rigorously defined three-dimensional geometric adjacency structure derived from an icosahedral–tetrahedral polyhedral cell complex. We show that similar graphs may be found in three-dimensional structures obtained from a periodic polyhedral packing (cell complex) built from tetrahedral and icosahedral cells. Importantly, we do not claim a face-to-face tessellation of R3 by congruent regular icosahedra and tetrahedra; instead, we define a specific periodic cell complex IT3 and work in its associated adjacency graph Γ(IT3). These geometric constructions expand lattice-based findings to a three-dimensional adjacency setting and provide new embeddings for Gallai-type graphs. Connections to AI systems are mentioned at the conceptual level.

Förderung

  • Abdullah Al Salem University, Kuwait

Zitieren

APA

Muhammad, N., Bashir, Y., Nadeem, M. F., & Ehtram, A. (2026). Fault-Tolerant Designs of Graphs with Gallai’s Property in Euclidean Space Tilings. Mathematical and Computational Applications, 31(3), 106. https://doi.org/10.3390/mca31030106

Vancouver

Muhammad N, Bashir Y, Nadeem MF, Ehtram A. Fault-Tolerant Designs of Graphs with Gallai’s Property in Euclidean Space Tilings. Mathematical and Computational Applications. 2026;31(3):106. doi:10.3390/mca31030106

BibTeX
@article{Muhammad2026,
  author = {Muhammad, Nazeer and Bashir, Yasir and Nadeem, Muhammad Faisal and Ehtram, Aqsa},
  title = {Fault-Tolerant Designs of Graphs with Gallai’s Property in Euclidean Space Tilings},
  journal = {Mathematical and Computational Applications},
  year = {2026},
  volume = {31},
  number = {3},
  pages = {106},
  doi = {10.3390/mca31030106}
}
Kostenlos starten →