- Tytuł:
- Domination in graphs and the removal of a matching
- Autorzy:
-
Boyer, Geoffrey
Goddard, Wayne - Tematy:
-
domination
matching
edge removal
trees - Pokaż więcej
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Powiązania:
- https://bibliotekanauki.pl/articles/59950418.pdf  Link otwiera się w nowym oknie
- Opis:
- We consider how the domination number of an undirected graph changes on the removal of a maximal matching. It is straightforward that there are graphs where no matching removal increases the domination number, and where some matching removal doubles the domination number. We show that in a nontrivial tree there is always a matching removal that increases the domination number; and if a graph has domination number at least $2$ there is always a maximal matching removal that does not double the domination number. We show that these results are sharp and discuss related questions.
- Dostawca treści:
- Biblioteka Nauki
Artykuł