Abstract
For k ≥ I an integer, a set S of vertices of a graph G = (V, E) is a k-dominating set of G if every vertex of V - S is within distance k from some vertex of S In this chapter, we survey some recent results concerning this distance version of domination in graphs.
| Original language | English |
|---|---|
| Title of host publication | Domination in Graphs |
| Subtitle of host publication | Advanced Topics |
| Publisher | CRC Press |
| Pages | 321-349 |
| Number of pages | 29 |
| ISBN (Electronic) | 0824700341, 9781351454643 |
| ISBN (Print) | 9780824700348 |
| DOIs | |
| Publication status | Published - 1 Jan 2017 |
| Externally published | Yes |
ASJC Scopus subject areas
- General Mathematics
Fingerprint
Dive into the research topics of 'Distance domination in graphs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver