Existence of efficient total dominating sets of circulant graphs of degree 4

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 dominating sets of circulant graphs whose degree is 4.

Saved in:
Bibliographic Details
Published in:Discrete mathematics 2020-03, Vol.343 (3), p.111742, Article 111742
Main Authors: Kwon, Young Soo, Sohn, Moo Young, Chen, Xue-gang
Format: Article
Language:English
Subjects:
Circulant graphs
Efficient total dominating sets
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 dominating sets of circulant graphs whose degree is 4.
ISSN:0012-365X
1872-681X
DOI:10.1016/j.disc.2019.111742