Efficient domination in Cayley graphs of generalized dihedral groups

Cafer Çalışkan; Štefko Miklavič; Sibel Özkan; Primož Šparl

doi:10.7151/dmgt.2309

ScienceGate Book Chapters

JOURNAL ARTICLE

Efficient domination in Cayley graphs of generalized dihedral groups

Cafer Çalışkan Štefko Miklavič Sibel Özkan Primož Šparl

Year: 2020 Journal: Discussiones Mathematicae Graph Theory Vol: 42 (3)Pages: 823-823 Publisher: De Gruyter Open

DOI: 10.7151/dmgt.2309

Get Full-Text PDF Get Analytical Report

Abstract

An independent subset D of the vertex set V of the graph Γ is an efficient dominating set for Γ if each vertex v ∈ V \ 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:

Dihedral group Mathematics Cayley graph Combinatorics Dihedral angle Discrete mathematics Group (periodic table) Graph

Metrics

Cited By

0.29

FWCI (Field Weighted Citation Impact)

Refs

0.60

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

Finite Group Theory Research

Physical Sciences → Mathematics → Discrete Mathematics and Combinatorics

Limits and Structures in Graph Theory

Physical Sciences → Mathematics → Discrete Mathematics and Combinatorics

Efficient domination in Cayley graphs of generalized dihedral groups

Abstract

Metrics

Citation History

Topics

Related Documents

CAYLEY GRAPHS OF GENERALIZED DIHEDRAL GROUPS

Cayley graphs on abelian and generalized dihedral groups

Pancyclicity and Cayley graphs on generalized dihedral groups

Hamilton paths in Cayley graphs on generalized dihedral groups

On the eigenvalues of Cayley graphs on generalized dihedral groups