arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2103.07375math.CO
收藏

关于图的边维数与分数边维数

On the edge dimension and fractional edge dimension of graphs

Eunjeong Yi

摘要:

设$G$是一个顶点集为$V(G)$、边集为$E(G)$的图,$d(u,w)$表示$G$中$u-w$测地线的长度.对于任何$v\in V(G)$和$e=xy\in E(G)$,记为$d(e,v)=\min\{d(x,v),d(y,v)\}$。对于不同的$e_1, e_2\in E(G)$,设为$R\{e_1,e_2\}=\{z\in V(G):d(z,e_1)\neq d(z,e_2)\}$。Kelenc et al. [Discrete Appl. Math. 251(2018)204-220]引入了图的边维数:如果对于任何不同的$e_1, e_2\in E(G)$有$|S\cap R\{e_1,e_2\}|\ge 1$,则顶点子集$S\subseteq V(G)$是$G$的边解析集,并且$G$的边维数$edim(G)$是$G$的所有边解析集中的最小基数。对于定义在$V(G)$上的实值函数$g$和$U\subseteq V(G)$,设$g(U)=\sum_{s\in U}g(s)$。则$g:V(G)\rightarrow[0,1]$是$G$的边缘分辨函数,如果对于任何不同的$e_1,e_2\in E(G)$有$g(R\{e_1,e_2\})\ge1$。$G$的分数边维数$edim_f(G)$是$\min\{g(V(G)):g\mbox{ is an edge resolving function of }G\}$。请注意,如果边缘解析函数的上域被限制为$\{0,1\}$,则$edim_f(G)$简化为$edim(G)$。引入并研究了分数边维数,得到了关于图的边维数的一些一般性结果。证明了在同一顶点集上存在两个具有相同边度量坐标的非同构图。我们构造了两个图$G$和$H$,使得$H \subset G$和$edim(H)-edim(G)$和$edim_f(H)-edim_f(G)$都可以是任意大的。证明了具有$edim(G)=2$的图$G$不能有$K_5$或$K_{3,3}$作为子图,并构造了满足$edim(H)=2$的非平面图$H$。很容易看出,对于任意阶为$n\ge3$,$1\le edim_f(G) \le \frac{n}{2}$的连通图$G$,我们刻画了满足$edim_f(G)=1$的图$G$,并研究了满足$edim_f(G)=\frac{n}{2}$的一些图类.我们还确定了几类图的分数边维数。

英文摘要:

Let $G$ be a graph with vertex set $V(G)$ and edge set $E(G)$, and let $d(u,w)$ denote the length of a $u-w$ geodesic in $G$. For any $v\in V(G)$ and $e=xy\in E(G)$, let $d(e,v)=\min\{d(x,v),d(y,v)\}$. For distinct $e_1, e_2\in E(G)$, let $R\{e_1,e_2\}=\{z\in V(G):d(z,e_1)\neq d(z,e_2)\}$. Kelenc et al. [Discrete Appl. Math. 251 (2018) 204-220] introduced the edge dimension of a graph: A vertex subset $S\subseteq V(G)$ is an edge resolving set of $G$ if $|S\cap R\{e_1,e_2\}|\ge 1$ for any distinct $e_1, e_2\in E(G)$, and the edge dimension $edim(G)$ of $G$ is the minimum cardinality among all edge resolving sets of $G$. For a real-valued function $g$ defined on $V(G)$ and for $U\subseteq V(G)$, let $g(U)=\sum_{s\in U}g(s)$. Then $g:V(G)\rightarrow[0,1]$ is an edge resolving function of $G$ if $g(R\{e_1,e_2\})\ge1$ for any distinct $e_1,e_2\in E(G)$. The fractional edge dimension $edim_f(G)$ of $G$ is $\min\{g(V(G)):g\mbox{ is an edge resolving function of }G\}$. Note that $edim_f(G)$ reduces to $edim(G)$ if the codomain of edge resolving functions is restricted to $\{0,1\}$. We introduce and study fractional edge dimension and obtain some general results on the edge dimension of graphs. We show that there exist two non-isomorphic graphs on the same vertex set with the same edge metric coordinates. We construct two graphs $G$ and $H$ such that $H \subset G$ and both $edim(H)-edim(G)$ and $edim_f(H)-edim_f(G)$ can be arbitrarily large. We show that a graph $G$ with $edim(G)=2$ cannot have $K_5$ or $K_{3,3}$ as a subgraph, and we construct a non-planar graph $H$ satisfying $edim(H)=2$. It is easy to see that, for any connected graph $G$ of order $n\ge3$, $1\le edim_f(G) \le \frac{n}{2}$; we characterize graphs $G$ satisfying $edim_f(G)=1$ and examine some graph classes satisfying $edim_f(G)=\frac{n}{2}$. We also determine the fractional edge dimension for some classes of graphs.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑