Total minus domination in \(k\)-partite graphs (Q2502903)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Total minus domination in \(k\)-partite graphs |
scientific article |
Statements
Total minus domination in \(k\)-partite graphs (English)
0 references
13 September 2006
0 references
A function \(f\) defined on the vertices of a graph \(G=(V,E)\), \(f:V \rightarrow \{-1,0,1\}\) is a total minus dominating function if the sum of its values over any open neighborhood is at least one. The weight of a total minus dominating function is the sum of its function values over all vertices. The total minus domination number, denoted by \(\gamma_{t}^{-}(G)\), of \(G\) is the minimum weight of a total minus dominating function on \(G\). The authors give a lower bound on \(\gamma_{t}^{-}(G)\), where \(G\) is a \(k\)-partite graph, and show that this bound is sharp.
0 references