Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Uda, Saeki"'
A dominating set $S$ of graph $G$ is called an $r$-grouped dominating set if $S$ can be partitioned into $S_1,S_2,\ldots,S_k$ such that the size of each unit $S_i$ is $r$ and the subgraph of $G$ induced by $S_i$ is connected. The concept of $r$-group
Externí odkaz:
http://arxiv.org/abs/2302.06983
Publikováno v:
In Theoretical Computer Science 21 May 2024 996
