Double Total Domination in Harary Graphs

Adel P. Kazemi, Behnaz Pahlavsay

Abstract


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.

Keywords


Double total domination number; Harary graph

Full Text:

PDF

References


T.W. Haynes, S.T. Hedetniemi and P.J. Slater, Fundamentals of Domination in Graphs, Marcel Dekker Inc., New York (1998).

T.W. Haynes, S.T. Hedetniemi and P.J. Slater (eds.), Domination in Graphs: Advanced Topics, Marcel Dekker, Inc., New York (1998).

M.A. Henning and A.P. Kazemi, k-tuple total domination in graphs, Discrete Applied Mathematics 158 (2010), 1006 – 1011.

M.A. Henning and A.P. Kazemi, k-tuple total domination in cross product of graphs, J. Comb. Optim. 24 (3) (2012), 339 – 346.

A.P. Kazemi, k-tuple total domination in complementary prismss, ISRN Discrete Mathematics 2011, article ID 681274 (2011), doi:10.5402/2011/681274.

A.P. Kazemi and B. Pahlavsay, k-tuple total domination in Supergeneralized Petersen graphs, Communications in Mathematics and Applications 2 (1) (2011), 21 – 30.

D.B. West, Introduction to Graph Theory, 2nd edition, Prentice Hall USA (2001).




DOI: http://dx.doi.org/10.26713%2Fcma.v8i1.701

Refbacks

  • There are currently no refbacks.


eISSN 0975-8607; pISSN 0976-5905