图的度量维数与区分数之间的联系
A Connection between Metric Dimension and Distinguishing Number of Graphs
AI总结:
该研究建立了图的度量维数与区分数的联系,证明连通图中分辨集可构造区分着色并得到上界,构造了满足参数关系的图,还刻画了特定区分数的几类图。
摘要:
本文介绍了图论中两个经典概念——度量维数(metric dimension)与区分数(distinguishing number)——之间的联系。对于给定的图$G$,令${\rm dim}(G)$和$D(G)$分别表示其度量维数和区分数。我们证明,在连通图中,任何分辨集都会打破图的对称性。确切地说,若$G$是一个连通图,且具有分辨集$S=\{v_1, v_2, \ldots, v_n \right\}$,则$\{\{v_1\}, \{v_2\}, \ldots, \{v_n\}, V(G)\setminus S \}$是$V(G)$的一个构成区分着色的划分,由此可得$D(G)\leq {\rm dim}(G)+1$。此外,我们构造了满足$D(G)=n$且${\rm dim}(G)=m$的图$G$,其中$1\leq n< m$的所有$n$、$m$取值均成立。利用这一联系,我们刻画了所有阶数为$n$且$D(G) \in \{n-1, n-2\}$的图$G$。对于任意图$G$,若$G$连通则令$G_c = G$,若$G$不连通则令$G_c = \overline{G}$。令$G^{\ast}$表示$G$的孪生图,它通过将任意具有相同开邻域或闭邻域的极大顶点集收缩为一个顶点得到。令${\rsfs F}$为所有图的集合,但不满足以下性质的图$G$除外:${\rm dim}(G_c)=|V(G)|-4$,${\rm diam}(G_c) \in \{2, 3\}$且$5\leq |V(G_{c}^{\ast})| \leq 9$。我们刻画了所有属于${\rsfs F}$、阶数为$n$且满足$D(G)= n-3$的图$G$。
英文摘要:
In this paper, we introduce a connection between two classical concepts of graph theory: \; metric dimension and distinguishing number. For a given graph $G$, let ${\rm dim}(G)$ and $D(G)$ represent its metric dimension and distinguishing number, respectively. We show that in connected graphs, any resolving set breaks the symmetry in the graphs. Precisely, if $G$ is a connected graph with a resolving set $S=\{v_1, v_2, \ldots, v_n \}$, then $\{\{v_1\}, \{v_2\}, \ldots, \{v_n\}, V(G)\setminus S \}$ is a partition of $V(G)$ into a distinguishing coloring, and as a consequence $D(G)\leq {\rm dim}(G)+1$. Furthermore, we construct graphs $G$ such that $D(G)=n$ and ${\rm dim}(G)=m$ for all values of $n$ and $m$, where $1\leq n< m$. Using this connection, we have characterized all graphs $G$ of order $n$ with $D(G) \in \{n-1, n-2\}$. For any graph $G$, let $G_c = G$ if $G$ is connected, and $G_c = \overline{G}$ if $G$ is disconnected. Let $G^{\ast}$ denote the twin graph obtained from $G$ by contracting any maximal set of vertices with the same open or close neighborhood into a vertex. Let {\rsfs F} be the set of all graphs except graphs $G$ with the property that ${\rm dim}(G_c)=|V(G)|-4$, ${\rm diam}(G_c) \in \{2, 3\}$ and $5\leq |V(G_{c}^{\ast})| \leq 9$. We characterize all graphs $G \in$ {\rsfs F} of order $n$ with the property that $D(G)= n-3$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。