|
|
|
|
on the total liar’s domination of graphs
|
|
|
|
|
|
|
|
نویسنده
|
seyedi narjes ,maimani hamid reza ,tehranian abolfazl
|
|
منبع
|
communications in combinatorics and optimization - 2022 - دوره : 7 - شماره : 2 - صفحه:169 -175
|
|
چکیده
|
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.
|
|
کلیدواژه
|
total liar's domination ,join of graphs ,graphs products
|
|
آدرس
|
islamic azad university, science and research branch, department of mathematics, iran, shahid rajaee teacher training university, mathematics section, department of basic sciences, iran, islamic azad university, science and research branch, department of mathematics, iran
|
|
پست الکترونیکی
|
tehranian@srbiau.ac.ir
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|