Variants of the Domination Number for Flower Snarks

We consider the flower snarks, a widely studied infinite family of 3--regular graphs. For the Flower snark $J_n$ on $4n$ vertices, it is trivial to show that the domination number of $J_n$ is equal to $n$. However, results are more difficult to determine for variants of domination. The Roman dominat...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Burdett, Ryan, Haythorpe, Michael, Newcombe, Alex
Format:	Artikel
Sprache:	eng
Schlagworte:	Mathematics - Combinatorics
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!