Author/Authors :
seyedi, narjes islamic azad university, science and research branch - department of mathematics, tehran, iran , maimani, hamid reza shahid rajaee teacher training university - mathematics section, department of basic sciences, tehran, iran , tehranian, abolfazl islamic azad university, science and research branch - department of mathematics, tehran, iran
Abstract :
for a graph g, a set l of vertices is called a total liar s domination if |ng(u)∩l|≥2 for any u∈v(g) and |(ng(u)∪ng(v))∩l|≥3 for any distinct vertices u,v∈v(g). the total liar’s domination number is the cardinality of a minimum total liar’s dominating set of g and is denoted by γtlr(g). in this paper we study the total liar s domination numbers of join and products of graphs.
