On the metric dimension of bilinear forms graphs

From MaRDI portal
Publication:409479

DOI10.1016/J.DISC.2011.11.020zbMATH Open1239.05052arXiv1104.4089OpenAlexW2150052178MaRDI QIDQ409479FDOQ409479


Authors: Min Feng, Kaishun Wang Edit this on Wikidata


Publication date: 13 April 2012

Published in: Discrete Mathematics (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1104.4089




Recommendations




Cites Work


Cited In (24)





This page was built for publication: On the metric dimension of bilinear forms graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q409479)