Efficient Domination in Cayley Graphs of Generalized Dihedral Groups
An independent subset of the vertex set of the graph Γ is an for Γ if each vertex ∈ has precisely one neighbour in . In this article, we classify the connected cubic Cayley graphs on generalized dihedral groups which admit an efficient dominating set.
Gespeichert in:
| Veröffentlicht in: | Discussiones Mathematicae. Graph Theory 2022-08, Vol.42 (3), p.823-841 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | An independent subset
of the vertex set
of the graph Γ is an
for Γ if each vertex
∈
has precisely one neighbour in
. In this article, we classify the connected cubic Cayley graphs on generalized dihedral groups which admit an efficient dominating set. |
|---|---|
| ISSN: | 1234-3099 2083-5892 |
| DOI: | 10.7151/dmgt.2309 |