arXiv Analytics

Sign in

arXiv:1104.4089 [math.CO]AbstractReferencesReviewsResources

On the metric dimension of bilinear forms graphs

Min Feng, Kaishun Wang

Published 2011-04-20, updated 2011-05-13Version 2

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.

Journal: Discrete Mathematics 312 (2012) 1266-1268
Categories: math.CO
Subjects: 05C12, 05E30
Related articles: Most relevant | Search more
arXiv:1010.4495 [math.CO] (Published 2010-10-21, updated 2011-11-24)
On the metric dimension of Grassmann graphs
arXiv:2011.12038 [math.CO] (Published 2020-11-24)
On metric dimension of digraphs
arXiv:1312.4971 [math.CO] (Published 2013-12-17, updated 2014-09-17)
On the metric dimension of imprimitive distance-regular graphs

Links

Toolbox