Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Restrained domination and its variants in extended supergrid graphs
RW Hung - Theoretical Computer Science, 2023 - Elsevier
Domination problem is a well-known NP-complete problem for general graphs. In this paper,
we will study its three variants, including restrained, independent restrained, and restrained …
we will study its three variants, including restrained, independent restrained, and restrained …
Paired restraint domination in extended supergrid graphs
Consider a graph G with vertex set V (G) and edge set E (G). A subset D of V (G) is said to be
a dominating set of G if every vertex not in D is adjacent to at least one vertex in D. If, in …
a dominating set of G if every vertex not in D is adjacent to at least one vertex in D. If, in …
Exact square coloring of certain classes of graphs: Complexity and algorithms
BS Panda - Theoretical Computer Science, 2022 - Elsevier
A vertex coloring of a graph G=(V, E) is called an exact square coloring of G if any two
vertices at distance exactly 2 receive different colors. The minimum number of colors …
vertices at distance exactly 2 receive different colors. The minimum number of colors …
Exact square coloring of certain classes of graphs:: Complexity and algorithms
Priyamvada, BS Panda - 2022 - dl.acm.org
A vertex coloring of a graph G=(V, E) is called an exact square coloring of G if any two
vertices at distance exactly 2 receive different colors. The minimum number of colors …
vertices at distance exactly 2 receive different colors. The minimum number of colors …