Skip to main navigation Skip to search Skip to main content

Tight bounds for eternal dominating sets in graphs

Research output: Contribution to journal › Article › peer-review

Original languageEnglish
Pages (from-to)2589-2593
Number of pages5
JournalDiscrete Mathematics
Volume308
Issue number12
DOIs
StatePublished - Jun 28 2008

ASJC Scopus Subject Areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Keywords

  • Dominating set
  • Eternal dominating set
  • Eternally secure set
  • Kneser graph

Fingerprint

Dive into the research topics of 'Tight bounds for eternal dominating sets in graphs'. Together they form a unique fingerprint.

Cite this