Upper Bounds in Terms of Minimum Degree

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

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

Abstract

As previously mentioned, since the decision problems related to the domination number, the total domination number, and the independent domination number are all NP-complete, it is of interest to determine good upper bounds on these parameters. In Chapter 4we presented some of the more basic bounds. In this chapterwe continue with bounds on these parameters in terms of the order of the graph and its minimum degree.

Original languageEnglish
Title of host publicationSpringer Monographs in Mathematics
PublisherSpringer Science and Business Media Deutschland GmbH
Pages129-208
Number of pages80
DOIs
Publication statusPublished - 2023

Publication series

NameSpringer Monographs in Mathematics
ISSN (Print)1439-7382
ISSN (Electronic)2196-9922

ASJC Scopus subject areas

  • General Mathematics

Fingerprint

Dive into the research topics of 'Upper Bounds in Terms of Minimum Degree'. Together they form a unique fingerprint.

Cite this