Spanning Directed Trails in Semicomplete 3-Multipartite Digraphs
University of Zawia Journal of Natural Sciences · 15.03.2025 · 2 (1) · 17-19
DOI: 10.26629/uzjns.2025.03 ↗Kurz gefasst
Fachartikel in der Zeitschrift University of Zawia Journal of Natural Sciences, online erschienen am 15.03.2025. Verfasst von Omaema O Lasfar.
Abstract (Originalsprache)
The study of spanning trails in digraphs associates two fundamental concepts: connectivity and independence. For general digraphs, establishing universal conditions remains an open challenge, but semi-complete multipartite digraphs reveal precise connectivity restrictions due to their well-defined structure. In this work, we prove that every strongly connected semi-complete 3-multipartite digraph D with arc-strong connectivity $\lambda(D) \ge \alpha(D)-1$ contains a spanning directed trail. This result provides evidence that multipartite structures may require weaker connectivity conditions than arbitrary digraphs, opening new directions for studying spanning trails in constrained digraph classes.
Zitieren
APA
Lasfar, O. O. (2025). Spanning Directed Trails in Semicomplete 3-Multipartite Digraphs. University of Zawia Journal of Natural Sciences, 2(1), 17-19. https://doi.org/10.26629/uzjns.2025.03
Vancouver
Lasfar OO. Spanning Directed Trails in Semicomplete 3-Multipartite Digraphs. University of Zawia Journal of Natural Sciences. 2025;2(1):17-19. doi:10.26629/uzjns.2025.03
BibTeX
@article{Lasfar2025,
author = {Lasfar, Omaema O},
title = {Spanning Directed Trails in Semicomplete 3-Multipartite Digraphs},
journal = {University of Zawia Journal of Natural Sciences},
year = {2025},
volume = {2},
number = {1},
pages = {17--19},
doi = {10.26629/uzjns.2025.03}
}
EUVIMED