Total domination and minimal total domination polynomial of H−join graphs

Authors

• Manikandan Subramanian, M. S. Ramaiah University of Applied Sciences
• A. Selvakumar, Indian Statistical Institute Bangalore

Article Type

Research Article

Publication Title

Filomat

Abstract

Let H be a connected labeled graph. In this article, we characterize all the total dominating sets and the minimal total dominating sets of H−join graphs. Consequently, we compute the (multivariate) total domination polynomial and the (multivariate) minimal total domination polynomial of H−join graphs. We also compute the total domination number of H−join graphs. Finally, as an illustration, we calculate the total domination polynomial and the minimal total domination polynomial of the join of graphs, multipartite graphs, Kn −join graphs, Kn1,…,nm −join graphs, the corona product of graphs and the windmill graphs.

First Page

267

Last Page

277

DOI

10.2298/FIL2501267S

Publication Date

1-1-2025

Recommended Citation

Subramanian, Manikandan and Selvakumar, A., "Total domination and minimal total domination polynomial of H−join graphs" (2025). Journal Articles. 5630.
https://digitalcommons.isical.ac.in/journal-articles/5630