Double Total Domination in Harary Graphs

Let \(G\) be a graph with minimum degree at least 2. A set \(D\subseteq V\) is a double total dominating set of \(G\) if each vertex is adjacent to at least two vertices in \(D\). The double total domination number \(\gamma _{\times 2,t}(G)\) of \(G\) is the minimum cardinality of a double total dom...

Full description

Saved in:
Bibliographic Details
Published in:Communications in Mathematics and Applications 2017-01, Vol.8 (1), p.1
Main Authors: Kazemi, Adel P, Pahlavsay, Behnaz
Format: Article
Language:English
Subjects:
Apexes
Graphs
Mathematics
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Let \(G\) be a graph with minimum degree at least 2. A set \(D\subseteq V\) is a double total dominating set of \(G\) if each vertex is adjacent to at least two vertices in \(D\). The double total domination number \(\gamma _{\times 2,t}(G)\) of \(G\) is the minimum cardinality of a double total dominating set of \(G\). In this paper, we will find double total domination number of Harary graphs.
ISSN:0976-5905
0975-8607
DOI:10.26713/cma.v8i1.701