PENDANT TOTAL DOMINATION NUMBER OF SOME GENERALIZED GRAPHS
Keywords:
DS, TDS, PTDS, PTDNDOI:
https://doi.org/10.17654/0974165822036Abstract
For a given graph $\mathcal{G}=(\mathcal{V}, \mathcal{E})$, a total dominating set $\mathcal{T}$ is called a pendant total dominating set if the subgraph $\langle\mathcal{T}\rangle$ induced by $\mathcal{T}$ contains at least one pendant vertex. The cardinality of a pendant total dominating set with smallest cardinal number is known as pendant total domination number of $\mathcal{G}$. In this paper, we determine the pendant total domination number of some generalized graphs.
Received: May 6, 2022
Accepted: July 15, 2022
References
E. J. Cockayne, R. M. Dawes and S. T. Hedetniemi, Total domination in graphs, Networks 10 (1980), 211-219.
J. Rani and S. Mehra, Pendant total domination in graphs, Advances and Applications in Mathematical Sciences (in communication).
M. A. Henning and A. Yeo, Total domination in graphs, Springer Monographs in Mathematics, New York, 2013.
S. R. Nayaka, Puttaswamy and S. Purushothama, Pendant domination in graphs, Journal of Combinatorial Mathematics and Combinatorial Computing 112(1) (2020), 219-229.
T. W. Haynes, S. T. Hedetniemi and P. J. Slater, Fundamentals of Domination in Graphs, Marcel Dekker, New York, 1998.
T. W. Haynes, S. T. Hedetniemi and P. J. Slater, Domination in Graphs Advanced Topics, Marcel Dekker, New York, 1998.
Downloads
Published
Issue
Section
License
Copyright (c) 2022 PUSHPA PUBLISHING HOUSE, PRAYAGRAJ, INDIA

This work is licensed under a Creative Commons Attribution 4.0 International License.
_________________________
Attribution: Credit Pushpa Publishing House as the original publisher, including title and author(s) if applicable.
Contact Pushpa Publishing House for more info or permissions.
Journal Impact Factor: 