DMGT

ISSN 1234-3099 (print version)

ISSN 2083-5892 (electronic version)

https://doi.org/10.7151/dmgt

Discussiones Mathematicae Graph Theory

IMPACT FACTOR 2018: 0.741

SCImago Journal Rank (SJR) 2018: 0.763

Rejection Rate (2018-2019): c. 84%

Discussiones Mathematicae Graph Theory

Article in press


Authors:

C. Caliskan, Š. Miklavič, S. Özkan, P. Šparl

Title:

Efficient domination in Cayley graphs of generalized dihedral groups

Source:

Discussiones Mathematicae Graph Theory

Received: 2019-09-27, Revised: 2020-02-04, Accepted: 2020-02-06, https://doi.org/10.7151/dmgt.2309

Abstract:

An independent subset $D$ of the vertex set $V$ of the graph $\Gamma$ is an efficient dominating set for $\Gamma$ if each vertex $v \in V \setminus D$ has precisely one neighbour in $D$. In this article, we classify the connected cubic Cayley graphs on generalized dihedral groups which admit an efficient dominating set.

Keywords:

efficient domination set, Cayley graph, generalized dihedral group

PDF
Close