| Summary: | A set of vertices of a graph <i>G</i> is a total dominating set if every vertex of <i>G</i> is adjacent to at least one vertex in such a set. We say that a total dominating set <i>D</i> is a total outer <i>k</i>-independent dominating set of <i>G</i> if the maximum degree of the subgraph induced by the vertices that are not in <i>D</i> is less or equal to <inline-formula> <math display="inline"> <semantics> <mrow> <mi>k</mi> <mo>−</mo> <mn>1</mn> </mrow> </semantics> </math> </inline-formula>. The minimum cardinality among all total outer <i>k</i>-independent dominating sets is the total outer <i>k</i>-independent domination number of <i>G</i>. 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 <i>k</i>-independent domination number of a graph <i>G</i> is an NP-hard problem.
|
|---|