Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Eternal and secure domination in graphs
WF Klostermeyer, CM Mynhardt - Topics in Domination in Graphs, 2020 - Springer
Mobile guards on the vertices of a graph are used to defend it against attacks that occur in
sequence on its vertices. Various models for this problem have been proposed. In this …
sequence on its vertices. Various models for this problem have been proposed. In this …
On semitotal domination in graphs
A set $ S $ of vertices of a connected graph $ G $ is a semitotal dominating set if every
vertex in $ V (G)\setminus S $ is adjacent to a vertex in $ S $, and every vertex in $ S $ is of …
vertex in $ V (G)\setminus S $ is adjacent to a vertex in $ S $, and every vertex in $ S $ is of …