A note on the k-domination number of a graph
The k-domination number of a graph G=G(V,E), γk(G), is the least cardinality of a set X⊂V such that any vertex in VX is adjacent to at least k vertices of X.
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
1990-01-01
|
| Series: | International Journal of Mathematics and Mathematical Sciences |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1155/S016117129000031X |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|