共 50 条
Total 2-domination in Grid graphs
被引:0
|作者:
Bermudo, Sergio
[1
]
Jalemskaya, Denis L.
[2
]
Sigarreta, Jose M.
[2
]
机构:
[1] Pablo Olavide Univ, Dept Econ Quantitat Methods & Econ Hist, Carretera Utrera Km 1, Seville 41013, Spain
[2] Autonomous Univ Guerrero, Fac Math, Carlos E Adame 5, Acapulco, Guerrero, Mexico
关键词:
total k-domination;
double total domination;
double domination;
TOTAL DOMINATION;
D O I:
暂无
中图分类号:
O29 [应用数学];
学科分类号:
070104 ;
摘要:
Let G = (V, E) be a graph, a set S subset of V is a total k-dominating set if every vertex v is an element of V has at least k neighbors in S. The total k-domination number gamma(kt)(G) is the minimum cardinality among all total k-dominating sets. In this paper we obtain some closed formulas for the total 2-domination number, also called double total domination number, of some grid graphs, and an upper and a lower bound for this parameter in any grid graph.
引用
收藏
页码:151 / 173
页数:23
相关论文