On the metric dimension of bilinear forms graphs
Combinatorics
2013-10-24 v2
Abstract
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.
Cite
@article{arxiv.1104.4089,
title = {On the metric dimension of bilinear forms graphs},
author = {Min Feng and Kaishun Wang},
journal= {arXiv preprint arXiv:1104.4089},
year = {2013}
}