Distance domination in graphs

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

14 Citations (Scopus)


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 languageEnglish
Title of host publicationDomination in Graphs
Subtitle of host publicationAdvanced Topics
PublisherCRC Press
Number of pages29
ISBN (Electronic)0824700341, 9781351454643
ISBN (Print)9780824700348
Publication statusPublished - 1 Jan 2017
Externally publishedYes

ASJC Scopus subject areas

  • General Mathematics


Dive into the research topics of 'Distance domination in graphs'. Together they form a unique fingerprint.

Cite this