Models of Domination in Graphs

Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning

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

5 Citations (Scopus)

Abstract

A set S of vertices in a graph G is a dominating set if every vertex not in S is adjacent to at least one vertex in S. In this chapter, we present logical models called frameworks, each of which gives a different perspective of dominating sets.

Original languageEnglish
Title of host publicationDevelopments in Mathematics
PublisherSpringer
Pages13-30
Number of pages18
DOIs
Publication statusPublished - 2020

Publication series

NameDevelopments in Mathematics
Volume64
ISSN (Print)1389-2177
ISSN (Electronic)2197-795X

Keywords

  • Domination
  • Frameworks for domination

ASJC Scopus subject areas

  • General Mathematics

Fingerprint

Dive into the research topics of 'Models of Domination in Graphs'. Together they form a unique fingerprint.

Cite this