Protection of Lexicographic Product Graphs

Douglas J. Klein, Juan A. Rodriguez-Velazquez

DISCUSSIONES MATHEMATICAE GRAPH THEORY（2022）

引用 6|浏览19

暂无评分

摘要

In this paper, we study the weak Roman domination number and the secure domination number of lexicographic product graphs. In particular, we show that these two parameters coincide for almost all lexicographic product graphs. Furthermore, we obtain tight bounds and closed formulas for these parameters.

查看译文

关键词

lexicographic product,weak Roman domination,secure domination,total domination,double total domination

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要