On the Secure Total Domination Number of Graphs
Open Access
Abstract
A total dominating set D of a graph G is said to be a secure total dominating set if for every vertex , there exists a vertex , which is adjacent to u, such that is a total dominating set as well. The secure total domination number of G is the minimum cardinality among all secure total dominating sets of G. In this article, we obtain new relationships between the secure total domination number and other graph parameters: namely the independence number, the matching number and other domination parameters. Some of our results are tight bounds that improve some well-known results.
Keywords
Funding Information
- Spanish Ministry of Economy, Industry and Competitiveness (MTM2016-78227-C2-1-P, MTM2017-90584-REDT)
This publication has 17 references indexed in Scilit:
- Total Weak Roman Domination in GraphsSymmetry, 2019
- On the weak Roman domination number of lexicographic product graphsDiscrete Applied Mathematics, 2019
- Graphs with equal secure total domination and inverse secure total domination numbersJournal of Information and Optimization Sciences, 2018
- Secure total domination in graphs: Bounds and complexityDiscrete Applied Mathematics, 2017
- On Secure Domination in GraphsInformation Processing Letters, 2015
- Bounds on weak roman and 2-rainbow domination numbersDiscrete Applied Mathematics, 2014
- Total outer-connected domination in treesDiscussiones Mathematicae Graph Theory, 2010
- Vertex Covers and Secure Domination in GraphsQuaestiones Mathematicae, 2008
- Secure domination and secure total domination in graphsDiscussiones Mathematicae Graph Theory, 2008
- Defending the Roman Empire—A new strategyDiscrete Mathematics, 2003