循环图$C(n,\pm\{1,2,3,4\})$的度量维数
The metric dimension of the circulant graph $C(n,\pm\{1,2,3,4\})$
摘要:
设$G=(V,E)$是一个连通图,$d(u,v)$表示顶点间的距离$u,v \in V$ . $G$的度量基是最小基数的集合$B\subseteq V$,使得$G$的任何两个顶点到$B$的所有点的距离都不相同。$G$的度量基的基数称为$G$的度量维数,用$\dim(G)$表示。本文确定了循环图$C(n,\pm\{1,2,3,4\})$对$n$的所有值的度量维数。
英文摘要:
Let $G=(V,E)$ be a connected graph and let $d(u,v)$ denote the distance between vertices $u,v \in V$. A metric basis for $G$ is a set $B\subseteq V$ of minimum cardinality such that no two vertices of $G$ have the same distances to all points of $B$. The cardinality of a metric basis of $G$ is called the metric dimension of $G$, denoted by $\dim(G)$. In this paper we determine the metric dimension of the circulant graphs $C(n,\pm\{1,2,3,4\})$ for all values of $n$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。