Domination parameters and the removal of matchings

Geoffrey Boyer, Wayne Goddard, Michael A. Henning

Research output: Contribution to journalArticlepeer-review


We consider the effect of the removal of a matching from a graph on the value of domination and domination-related parameters with emphasis on the removal of a maximum matching from a cubic graph or tree. For example, we show that the independent domination number of a nontrivial tree increases on the removal of any maximum matching.

Original languageEnglish
Article number128752
JournalApplied Mathematics and Computation
Publication statusPublished - 1 Sept 2024

ASJC Scopus subject areas

  • Computational Mathematics
  • Applied Mathematics


Dive into the research topics of 'Domination parameters and the removal of matchings'. Together they form a unique fingerprint.

Cite this