Next Article in Journal
A Note on Extended Z-Contraction
Previous Article in Journal
Truth-Teller–Liar Puzzles with Self-Reference
Previous Article in Special Issue
The Simultaneous Strong Resolving Graph and the Simultaneous Strong Metric Dimension of Graph Families
Open AccessArticle

On the Total Outer k-Independent Domination Number of Graphs

1
Departament d’Enginyeria Informàtica i Matemàtiques, Universitat Rovira i Virgili, Av. Països Catalans 26, 43007 Tarragona, Spain
2
Facultad de Matemáticas, Universidad Autónoma de Guerrero, Carlos E. Adame 5, Col. La Garita 39650, Acapulco, Mexico
*
Author to whom correspondence should be addressed.
Mathematics 2020, 8(2), 194; https://doi.org/10.3390/math8020194
Received: 23 December 2019 / Revised: 18 January 2020 / Accepted: 23 January 2020 / Published: 5 February 2020
(This article belongs to the Special Issue Distances and Domination in Graphs)
A set of vertices of a graph G is a total dominating set if every vertex of G is adjacent to at least one vertex in such a set. We say that a total dominating set D is a total outer k-independent dominating set of G if the maximum degree of the subgraph induced by the vertices that are not in D is less or equal to k - 1 . The minimum cardinality among all total outer k-independent dominating sets is the total outer k-independent domination number of G. In this article, we introduce this parameter and begin with the study of its combinatorial and computational properties. For instance, we give several closed relationships between this novel parameter and other ones related to domination and independence in graphs. In addition, we give several Nordhaus–Gaddum type results. Finally, we prove that computing the total outer k-independent domination number of a graph G is an NP-hard problem.
Keywords: total outer k-independent domination; total domination; k-independence total outer k-independent domination; total domination; k-independence
MDPI and ACS Style

Cabrera Martínez, A.; Hernández-Gómez, J.C.; Inza, E.P.; Sigarreta, J.M. On the Total Outer k-Independent Domination Number of Graphs. Mathematics 2020, 8, 194.

Show more citation formats Show less citations formats
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Back to TopTop