Bounds in Terms of Size

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

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

Abstract

The order |V| = n and size |E| = m of a graph G = (V, E) are the two most fundamental graph parameters. In this chapter, we study how the size of a graph relates to its domination, total domination, and independent domination numbers.

Original languageEnglish
Title of host publicationSpringer Monographs in Mathematics
PublisherSpringer Science and Business Media Deutschland GmbH
Pages237-258
Number of pages22
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 'Bounds in Terms of Size'. Together they form a unique fingerprint.

Cite this