For a given graph  a total dominating set  is called a pendant total dominating set if the subgraph  induced by  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  In this paper, we determine the pendant total domination number of some generalized graphs.

DS, TDS, PTDS, PTDN

Received: May 6, 2022; Accepted: July 15, 2022; Published: August 3, 2022

How to cite this article: Jyoti Rani and Seema Mehra, Pendant total domination number of some generalized graphs, Advances and Applications in Discrete Mathematics 33 (2022), 19-44. http://dx.doi.org/10.17654/0974165822036

This Open Access Article is Licensed under Creative Commons Attribution 4.0 International License

References:
[1] E. J. Cockayne, R. M. Dawes and S. T. Hedetniemi, Total domination in graphs, Networks 10 (1980), 211-219.
[2] J. Rani and S. Mehra, Pendant total domination in graphs, Advances and Applications in Mathematical Sciences (in communication).
[3] M. A. Henning and A. Yeo, Total domination in graphs, Springer Monographs in Mathematics, New York, 2013.
[4] S. R. Nayaka, Puttaswamy and S. Purushothama, Pendant domination in graphs, Journal of Combinatorial Mathematics and Combinatorial Computing 112(1) (2020), 219-229.
[5] T. W. Haynes, S. T. Hedetniemi and P. J. Slater, Fundamentals of Domination in Graphs, Marcel Dekker, New York, 1998.
[6] T. W. Haynes, S. T. Hedetniemi and P. J. Slater, Domination in Graphs Advanced Topics, Marcel Dekker, New York, 1998.