← Back to Volume 47, Issue 2 Contents
RESTRAINED PENDANT DOMINATION IN GRAPHS
Swaroopa Rani N C1, B. Shanmukha2
1 Department of Mathematics, Government College (Autonomous), Mandya University, Mandya-571401
2 Department of Mathematics, P.E.S. College of Engineering, Mandya-571401
Volume: 47Issue: 2Pages: 359–367Year: 2025ISSN: 0970-5120
⬇ Download Full PDF
Abstract
In this article we initiate the study of a variation of standard domination, namely restrained pendant domination. Let $G=(V,E)$ be any graph. A dominating set $S$ in $G$ is called a pendant dominating set if $\langle S \rangle$ contains at least one pendant node. The minimum cardinality of the pendant dominating set in $G$ is called the pendant domination number of $G$, denoted by $\gamma_{pe}(G)$. A restrained pendant dominating set is a set $S \subseteq V$ where every node in $V-S$ is adjacent to a node in $S$ as well as another node in $V-S$. The restrained pendant domination number of $G$, denoted by $\gamma_{rpe}$, is the minimum cardinality of a restrained pendant dominating set of $G$. We determine best possible upper and lower bounds for $\gamma_{rpe}(G)$ and also calculated the exact value for some standard families graphs.
Keywords: Dominating Set, Restrained Dominating Set, Pendant Dominating Set, Restrained Pendant Dominating Set, Pendant Domination Number
MSC 2020: 05C50, 05C69
How to Cite
Swaroopa Rani N C, B. Shanmukha, RESTRAINED PENDANT DOMINATION IN GRAPHS, Journal of the Indian Academy of Mathematics, 47(2) (2025), 359–367.
References
- J.A. Bondy, U.S.R. Murty, Graph theory with application, Elsevier Science Publishing Co, Sixth printing, 1984.
- T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Domination in Graphs: Advanced Topics, Marcel Dekker, New York, 1998.
- T.W. Haynes, S.T. Hedetniemi, P.J. Slater, Fundamentals of Domination in Graphs, Marcel Dekker, New York, 1998.
- S.T. Hedetniemi and R.C. Laskar, Topics on Domination, Discrete Math. 86 (1990).
- Johannes H. Hattingh, Some Recent Results on Restrained Domination. The 23rd Mini-conference on Discrete Mathematics and Algorithms, Georgia State University, Atlanta, GA, USA, 2008.
- Nayaka S.R, Puttaswamy and Purushothama S, Pendant Domination in Graphs, The Journal of Combinatorial Mathematics and Combinatorial Computing, pp. 219–230 (2020).
- Nayaka S.R, Puttaswamy and Purushothama S, Pendant Domination in Some Generalized Graphs, International Journal of Scientific Engineering and Science, Volume 1, Issue 7, (2017), pp. 13–15.
- Purushothama S, Puttaswamy and Nayaka S.R., Pendant Domination in Double Graphs, Proceedings of the Jangjeon Mathematical Society, Volume 23(2), 2020.
© Journal of the Indian Academy of Mathematics