English

Double Total Domination in Harary Graphs

Combinatorics 2019-08-06 v1

Abstract

Let GG be a graph with minimum degree at least 2. A set DVD\subseteq V is a double total dominating set of GG if each vertex is adjacent to at least two vertices in DD. The double total domination number γ×2,t(G)\gamma _{\times 2,t}(G) of GG is the minimum cardinality of a double total dominating set of GG. 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}
}
R2 v1 2026-06-22T13:06:07.262Z