关于双线性型图的度量维数
On the metric dimension of bilinear forms graphs
摘要：
一个图的度量维数是一个集合中顶点的最小数目，它的性质是从任何顶点到集合中的顶点的距离列表唯一地标识该顶点。Bailey和Meagher得到了Grassmann图的度量维数的一个上界。本文给出了双线性型图的度量维数的一个上界。
英文摘要：
The 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. Bailey and Meagher obtained an upper bound on the metric dimension of Grassmann graphs. In this paper we obtain an upper bound on the metric dimension of bilinear forms graphs.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
