The signed and minus \(k\)-subdomination numbers of certain complete multipartite graphs and their complements (Q2725013)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The signed and minus \(k\)-subdomination numbers of certain complete multipartite graphs and their complements |
scientific article; zbMATH DE number 1618587
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The signed and minus \(k\)-subdomination numbers of certain complete multipartite graphs and their complements |
scientific article; zbMATH DE number 1618587 |
Statements
28 November 2001
0 references
signed domination
0 references
minus domination
0 references
complete multipartite graph
0 references
split graph
0 references
The signed and minus \(k\)-subdomination numbers of certain complete multipartite graphs and their complements (English)
0 references
The signed (minus) \(k\)-subdomination number of a graph \(G=(V,E)\) is the minimum weight \(f(V)=\sum_{u\in V}f(u)\) of a function \(f:V\to \{ -1,1\}\) (\(f:V\to \{ -1,0,1\}\)) such that \(f(N[u])\geq 1\) for at least \(k\) vertices \(u\in V\). The authors determine these two domination parameters for complete graphs, complete bipartite graphs, disjoint unions of two complete graphs and split graphs.
0 references
