Domination and minimal domination polynomial of H-generalized join graphs
Filomat · 2025 · 39 (24) · 8519-8543
DOI: 10.2298/fil2524519a ↗Kurz gefasst
Fachartikel in der Zeitschrift Filomat, 2025. Verfasst von A. Selvakumar und 2 weiteren Autor:innen. Die Arbeit nennt 25 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC0).
Abstract (Originalsprache)
Let H be a connected labeled graph. A H -generalized join graph is a graph obtained by H -generalized join operation of family of graphs G = \{G_v : v \in V(H)\} constrained by family of vertex subsets S = \{S_v \subseteq V(G_v) : v \in V(H)\} . In this article, we characterize all the dominating sets and the minimal dominating sets of H -generalized join graphs. Consequently, we compute the (multivariate) domination polynomial and the minimal domination polynomial of H -generalized join graphs. We also compute the domination number of H -generalized join graphs. Finally, as an illustration, we calculate the domination polynomial and the minimal domination polynomial of multipartite graphs, the corona product of graphs, K_n -generalized join graphs, and K_{n_1, ..., n_m} -generalized join graphs.
Zitieren
APA
Selvakumar, A., Manikandan, S., & Murugan, S. (2025). Domination and minimal domination polynomial of H-generalized join graphs. Filomat, 39(24), 8519-8543. https://doi.org/10.2298/fil2524519a
Vancouver
Selvakumar A, Manikandan S, Murugan S. Domination and minimal domination polynomial of H-generalized join graphs. Filomat. 2025;39(24):8519-8543. doi:10.2298/fil2524519a
BibTeX
@article{Selvakumar2025,
author = {Selvakumar, A. and Manikandan, S. and Murugan, S.P.},
title = {Domination and minimal domination polynomial of H-generalized join graphs},
journal = {Filomat},
year = {2025},
volume = {39},
number = {24},
pages = {8519--8543},
doi = {10.2298/fil2524519a}
}
EUVIMED