图的距离控制与可分解性的组合研究
A study of a combination of distance domination and resolvability in graphs
摘要:
对于$k \geq 1$,在图$G=(V,E)$中,如果$V\setminus D$中的任一顶点与$D$中的某个顶点的距离至多为$k$,则顶点集$D$是$G$的距离$k$ -控制集. $G$的距离$k$ -控制集的最小基数是距离$k$ -控制数,记为$γ_k(G)$。一个有序顶点集$W=\{w_1,w_2,\ldots,w_r\}$是$G$的一个分解集,如果对于$V\setminus W$中的任意两个不同顶点$x$和$y$,存在$1\leq i\leq r$,使得$d_G(x,w_i)\neq d_G(y,w_i)$ . $G$的分解集的最小基数是图$G$的度量维数,用$dim(G)$表示。本文引入了距离$k$ -分解控制集,它是$V$的一个子集,它既是距离$k$ -控制集,又是$G$的一个分解集。$G$的距离$k$ -分解控制集的最小基数称为距离$k$ -分解控制数,记为$γ^r_k(G)$ .我们给出了$γ^r_k(G)$ some的度量维数$dim(G)$和距离$k$ -控制数$γ_k(G)$的几个界.当$G$是路径或循环时,我们确定$γ^r_k(G)$。然后,我们刻画了$n$阶连通图的特征,其中对于$k\geq 2$,$γ^r_k(G)$等于$1$,$n-2$和$n-1$。然后,我们为所有$k\geq 2$构建实现所有可能的三重组$(dim(G),γ_k(G),γ^r_k (G))$的图。之后,我们确定了具有距离$k$ -可分解控制数$γ^r_k(G)=γ^r_k\geq 1$的图$G$的最大阶,并给出了对任意正整数$k$和$γ^r_k$都能达到这个最大阶的图.最后,我们建立了$γ^r_k(G)$,$k\geq 2$的Nordhaus-Gaddum界。
英文摘要:
For $k \geq 1$, in a graph $G=(V,E)$, a set of vertices $D$ is a distance $k$-dominating set of $G$, if any vertex in $V\setminus D$ is at distance at most $k$ from some vertex in $D$. The minimum cardinality of a distance $k$-dominating set of $G$ is the distance $k$-domination number, denoted by $γ_k(G)$. An ordered set of vertices $W=\{w_1,w_2,\ldots,w_r\}$ is a resolving set of $G$, if for any two distinct vertices $x$ and $y$ in $V\setminus W$, there exists $1\leq i\leq r$, such that $d_G(x,w_i)\neq d_G(y,w_i)$. The minimum cardinality of a resolving set of $G$ is the metric dimension of the graph $G$, denoted by $dim(G)$. In this paper, we introduce the distance $k$-resolving dominating set, which is a subset of $V$ that is both a distance $k$-dominating set and a resolving set of $G$. The minimum cardinality of a distance $k$-resolving dominating set of $G$ is called the distance $k$-resolving domination number and is denoted by $γ^r_k(G)$. We give several bounds for $γ^r_k(G)$ some in terms of the metric dimension $dim(G)$ and the distance $k$-domination number $γ_k(G)$. We determine $γ^r_k(G)$ when $G$ is a path or a cycle. Afterwards, we characterize the connected graphs of order $n$ having $γ^r_k(G)$ equal to $1$, $n-2$, and $n-1$, for $k\geq 2$. Then, we construct graphs realizing all the possible triples $(dim(G),γ_k(G),γ^r_k (G))$, for all $k\geq 2$. Later, we determine the maximum order of a graph $G$ having distance $k$-resolving domination number $γ^r_k(G)=γ^r_k\geq 1$, we provide graphs achieving this maximum order for any positive integers $k$ and $γ^r_k$. Finally, we establish Nordhaus-Gaddum bounds for $γ^r_k(G)$, for $k\geq 2$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。