Classification of Efficient Total Domination Sets of Circulant Graphs of Degree 5

Classification of Efficient Total Domination Sets of Circulant Graphs of Degree 5

An efficient total dominating set D of a graph G is a vertex subset such that every vertex of G has exactly one neighbor in the set D. In this paper, we give necessary and sufficient conditions for the existence of efficient total domination sets of circulant graphs whose degree is 5 and classify th...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Symmetry (Basel) 2020-12, Vol.12 (12), p.1944
Hauptverfasser: Soo Kwon, Young Soo, Young Sohn, Moo Young
Format: Artikel
Sprache:eng
Schlagworte:
circulant graphs
Classification
efficient total domination sets
Graphs
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:An efficient total dominating set D of a graph G is a vertex subset such that every vertex of G has exactly one neighbor in the set D. In this paper, we give necessary and sufficient conditions for the existence of efficient total domination sets of circulant graphs whose degree is 5 and classify these sets.
ISSN:2073-8994
2073-8994
DOI:10.3390/sym12121944