On the metric dimension of bilinear forms graphs

From MaRDI portal
Publication:409479




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.









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)