关于Grassmann图的度量维数
On the metric dimension of Grassmann graphs
摘要:
图$Γ$的{ \em度量维数}是一个集合中顶点的最小数目,该集合具有从任何顶点到集合中的顶点的距离的列表唯一地标识该顶点的性质。考虑了$k\geq 2$的Grassmann图$G_q(n,k)$(其顶点是$\mathbb{F}_q^n$的$k$ -子空间,如果它们相交于一个$(k-1)$ -子空间,则它们是相邻的),并找到了其度量维数的一个构造性上界.我们的界等于$\mathbb{F}_q^n$的1维子空间的数目。
英文摘要:
The {\em metric dimension} of a graph $Γ$ is the least number of vertices in a set with the property that the list of distances from any vertex to those in the set uniquely identifies that vertex. We consider the Grassmann graph $G_q(n,k)$ (whose vertices are the $k$-subspaces of $\mathbb{F}_q^n$, and are adjacent if they intersect in a $(k-1)$-subspace) for $k\geq 2$, and find a constructive upper bound on its metric dimension. Our bound is equal to the number of 1-dimensional subspaces of $\mathbb{F}_q^n$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。