Double Total Domination in Harary Graphs
Combinatorics
2019-08-06 v1
Abstract
Let be a graph with minimum degree at least 2. A set is a double total dominating set of if each vertex is adjacent to at least two vertices in . The double total domination number of is the minimum cardinality of a double total dominating set of . In this paper, we will find double total domination number of Harary graphs.
Keywords
Cite
@article{arxiv.1603.02430,
title = {Double Total Domination in Harary Graphs},
author = {Adel P. Kazemi and Behnaz Pahlavsay},
journal= {arXiv preprint arXiv:1603.02430},
year = {2019}
}