The Locating Total Domination Polynomial of the Join of Graphs.
International Journal of Mathematics and Computer Science · 2026 · 415-420
DOI: 10.69793/ijmcs/02.2026/benjamin ↗Kurz gefasst
Fachartikel in der Zeitschrift International Journal of Mathematics and Computer Science, 2026. Verfasst von Benjamin Omamalin.
Abstract (Originalsprache)
In this work, we introduce a new graph polynomial counting the locating total dominating sets of G. This polynomial encodes the full distribution of such sets. Using known structural characterizations of locating total dominating sets, we derive explicit formulas for the join of graphs. In particular, we obtain a product formula for the join and related formulas for joins with complete graphs. These results extend the numerical theory of locating total domination to an enumerative setting.
Zitieren
APA
Omamalin, B. (2026). The Locating Total Domination Polynomial of the Join of Graphs. International Journal of Mathematics and Computer Science, 415-420. https://doi.org/10.69793/ijmcs/02.2026/benjamin
Vancouver
Omamalin B. The Locating Total Domination Polynomial of the Join of Graphs. International Journal of Mathematics and Computer Science. 2026:415-420. doi:10.69793/ijmcs/02.2026/benjamin
BibTeX
@article{Omamalin2026,
author = {Omamalin, Benjamin},
title = {The Locating Total Domination Polynomial of the Join of Graphs},
journal = {International Journal of Mathematics and Computer Science},
year = {2026},
pages = {415--420},
doi = {10.69793/ijmcs/02.2026/benjamin}
}
EUVIMED