关于图的字典积的[1,k]-集的一些结果
Some Results on [1, k]-sets of Lexicographic Products of Graphs
摘要:
图$G = (V,E)$中的一个子集$S \subseteq V$称为$[1, k]$ -集,如果对每个顶点$v \in V \setminus S$,有$1 \leq | N_G(v) \cap S | \leq k$ . $G$的$[1,k]$ -控制数,记为$γ_{[1, k]}(G)$,是$G$的最小$[1,k]$ -集的大小.一个集合$S'\subseteq V(G)$称为全$[1,k]$ -集合,如果对于每个顶点$v \in V$,有$1 \leq | N_G(v) \cap S | \leq k$ .如果一个图$G$至少有一个全$[1, k]$ -集,那么最小的这个集的基数用$γ_{t[1, k]}(G)$表示。我们认为$[1, k]$ -集也是独立的。注意,不是每个图都有独立的$[1, k]$ -集。对于具有独立$[1, k]$ -集的图,我们定义了$[1, k]$ -独立数,记为$γ_{i[1, k]}(G)$ .本文研究了字典积$G\circ H$中$[1,k]$ -集的存在性.此外,我们完全刻画了字典积至少有一个全$[1,k]$ -集的图。此外,我们还测定了$γ_{[1, k]}(G\circ H)$、$γ_{t[1, k]}(G\circ H)$和$γ_{i[1, k]}(G\circ H)$。最后,证明了寻找最小的$[1, k]$ -全集是$NP$ -完全的.
英文摘要:
A subset $S \subseteq V$ in a graph $G = (V,E)$ is called a $[1, k]$-set, if for every vertex $v \in V \setminus S$, $1 \leq | N_G(v) \cap S | \leq k$. The $[1,k]$-domination number of $G$, denoted by $γ_{[1, k]}(G)$ is the size of the smallest $[1,k]$-sets of $G$. A set $S'\subseteq V(G)$ is called a total $[1,k]$-set, if for every vertex $v \in V$, $1 \leq | N_G(v) \cap S | \leq k$. If a graph $G$ has at least one total $[1, k]$-set then the cardinality of the smallest such set is denoted by $γ_{t[1, k]}(G)$. We consider $[1, k]$-sets that are also independent. Note that not every graph has an independent $[1, k]$-set. For graphs having an independent $[1, k]$-set, we define $[1, k]$-independence numbers which is denoted by $γ_{i[1, k]}(G)$. In this paper, we investigate the existence of $[1,k]$-sets in lexicographic products $G\circ H$. Furthermore, we completely characterize graphs which their lexicographic product has at least one total $[1,k]$-set. Also, we determine $γ_{[1, k]}(G\circ H)$, $γ_{t[1, k]}(G\circ H)$ and $γ_{i[1, k]}(G\circ H)$. Finally, we show that finding smallest total $[1, k]$-set is $NP$-complete.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。