Abstract
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 language | English |
---|---|
Article number | 128752 |
Journal | Applied Mathematics and Computation |
Volume | 476 |
DOIs | |
Publication status | Published - 1 Sept 2024 |
ASJC Scopus subject areas
- Computational Mathematics
- Applied Mathematics