图的分数$k$ -度量维数
The fractional $k$-metric dimension of graphs
摘要:
设$G$是一个顶点集为$V(G)$的图。对于$G$的任何两个不同顶点$x$和$y$,令$R\{x, y\}$表示顶点集合$z$,使得从$x$到$z$的距离不等于$G$中从$y$到$z$的距离。对于在$V(G)$上定义的函数$g$和$U \subseteq V(G)$,设$g(U)=\sum_{s \in U}g(s)$。令$κ(G)=\min\{|R\{x,y\}|: x\neq y \mbox{ and } x,y \in V(G)\}$。对于任何实数$k \in [1, κ(G)]$,实值函数$g: V(G) \rightarrow [0,1]$是$G$的一个\emph{$k$-resolving function},如果$g(R\{x,y\}) \ge k$对于任何两个不同的顶点$x,y \in V(G)$。$G$的\emph{fractional $k$-metric dimension}、$\dim^k_f(G)$为$\min\{g(V(G)): g \mbox{ is a $ k $-resolving function of } G\}$。本文主要研究图的分数$k$ -度量维数.对于连通图$G$和$k \in [1, κ(G)]$,很容易看出,$k \le \dim_f^k(G) \le \frac{k|V(G)|}{κ(G)}$ ;我们刻画了图$G$分别满足$\dim_f^k(G)=k$和$\dim_f^k(G)=|V(G)|$。我们表明,$\dim_f^k(G) \ge k \dim_f(G)$的任何$k \in [1, κ(G)]$,我们给出了一个例子表明,$\dim_f^k(G)-k\dim_f(G)$可以是任意大的一些$k \in (1, κ(G)]$,我们还描述了一个条件,$\dim_f^k(G)=k\dim_f(G)$持有。我们确定了几类图的分数$k$ -度量维数,并得出了两个公开的问题,包括$ϕ(k)=\dim_f^k(G)$是否是$k$在每个连通图$G$上的连续函数。
英文摘要:
Let $G$ be a graph with vertex set $V(G)$. For any two distinct vertices $x$ and $y$ of $G$, let $R\{x, y\}$ denote the set of vertices $z$ such that the distance from $x$ to $z$ is not equal to the distance from $y$ to $z$ in $G$. For a function $g$ defined on $V(G)$ and for $U \subseteq V(G)$, let $g(U)=\sum_{s \in U}g(s)$. Let $κ(G)=\min\{|R\{x,y\}|: x\neq y \mbox{ and } x,y \in V(G)\}$. For any real number $k \in [1, κ(G)]$, a real-valued function $g: V(G) \rightarrow [0,1]$ is a \emph{$k$-resolving function} of $G$ if $g(R\{x,y\}) \ge k$ for any two distinct vertices $x,y \in V(G)$. The \emph{fractional $k$-metric dimension}, $\dim^k_f(G)$, of $G$ is $\min\{g(V(G)): g \mbox{ is a $k$-resolving function of } G\}$. In this paper, we initiate the study of the fractional $k$-metric dimension of graphs. For a connected graph $G$ and $k \in [1, κ(G)]$, it's easy to see that $k \le \dim_f^k(G) \le \frac{k|V(G)|}{κ(G)}$; we characterize graphs $G$ satisfying $\dim_f^k(G)=k$ and $\dim_f^k(G)=|V(G)|$, respectively. We show that $\dim_f^k(G) \ge k \dim_f(G)$ for any $k \in [1, κ(G)]$, and we give an example showing that $\dim_f^k(G)-k\dim_f(G)$ can be arbitrarily large for some $k \in (1, κ(G)]$; we also describe a condition for which $\dim_f^k(G)=k\dim_f(G)$ holds. We determine the fractional $k$-metric dimension for some classes of graphs, and conclude with two open problems, including whether $ϕ(k)=\dim_f^k(G)$ is a continuous function of $k$ on every connected graph $G$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。