On the metric dimension of bilinear forms graphs

TL;DR

This paper investigates the metric dimension of bilinear forms graphs, providing new upper bounds and extending previous work on related graph classes like Grassmann graphs.

Contribution

It introduces an upper bound on the metric dimension of bilinear forms graphs, advancing understanding of their structural properties.

Findings

Established an upper bound on the metric dimension of bilinear forms graphs

Extended methods from Grassmann graphs to bilinear forms graphs

Contributed to the theoretical understanding of graph metric properties

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.