A note on the k-domination number of a graph (Q919005): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 01:36, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on the k-domination number of a graph |
scientific article |
Statements
A note on the k-domination number of a graph (English)
0 references
1990
0 references
The k-domination number of a graph \(G=G(V,E),\) \(c_ k(G)\), is the least cardinality of a set \(X\subset V\) such that any vertex in \(V\setminus X\) is adjacent to at least k vertices of X. The authors prove the following theorem: Let n, k be positive integers. If the minimum degree of vertices in the graph \(G(V,E)\geq ((n+1)/k)k-1,\) then \(c_ k(G)\leq n| V| /(n+1)\).
0 references
k-domination number
0 references
minimum degree
0 references
