The Locating Total Domination Polynomial of the Join of Graphs.
International Journal of Mathematics and Computer Science · 2026 · 421-425
DOI: 10.69793/ijmcs/02.2026/asmj ↗Kurz gefasst
Fachartikel in der Zeitschrift International Journal of Mathematics and Computer Science, 2026. Verfasst von Rosalio Artes und 3 weiteren Autor:innen.
Abstract (Originalsprache)
The biclique polynomial of a graph counts vertex subsets that induce complete bipartite subgraphs. In this paper, we study structural and algebraic properties of this polynomial. We show that every nontrivial graph has a double root at the origin, and that biclique polynomials are additive over connected components. An explicit coefficient formula is obtained for complete bipartite graphs. The main result is a root-theoretic description of \(b^*(K_{m,n};x)\), including its zeros, their multiplicities in terms of \(\gcd(m,n)\), and the fact that all zeros lie on the circle \(|x+1|=1\). These results extend the initial counting formulas and clarify the algebraic structure of biclique polynomials for complete bipartite graphs.
Zitieren
APA
Artes, R., Sevilla, A., Matulac, M., & Junio, B. (2026). The Locating Total Domination Polynomial of the Join of Graphs. International Journal of Mathematics and Computer Science, 421-425. https://doi.org/10.69793/ijmcs/02.2026/asmj
Vancouver
Artes R, Sevilla A, Matulac M, Junio B. The Locating Total Domination Polynomial of the Join of Graphs. International Journal of Mathematics and Computer Science. 2026:421-425. doi:10.69793/ijmcs/02.2026/asmj
BibTeX
@article{Artes2026,
author = {Artes, Rosalio and Sevilla, Alvin and Matulac, Marchelle and Junio, Bhusra},
title = {The Locating Total Domination Polynomial of the Join of Graphs},
journal = {International Journal of Mathematics and Computer Science},
year = {2026},
pages = {421--425},
doi = {10.69793/ijmcs/02.2026/asmj}
}
EUVIMED