QR-Code

Reconfiguring Minimum Dominating Sets: The γ-Graph of a Tree

We consider γ-graphs, which are reconfiguration graphs of the minimum dominating sets of a graph G. We answer three open questions about γ- graphs of trees by providing upper bounds on the maximum degree, the diameter, and the number of minimum dominating sets. The latter gives an upper bound on the...

Ausführliche Beschreibung

Gespeichert in:
Bibliografische Detailangaben
Hauptverfasser: Edwards Michelle, MacGillivray Gary, Nasserasr Shahla
Format: Artigo
Sprache:Inglês
Veröffentlicht: University of Zielona Góra 2018-08-01
Schriftenreihe:Discussiones Mathematicae Graph Theory
Schlagworte:
Online-Zugang:https://doi.org/10.7151/dmgt.2044
Tags: Tag hinzufügen
Keine Tags, Fügen Sie das erste Tag hinzu!