On the metric dimension of bilinear forms graphs

Details On the metric dimension of bilinear forms graphs On the metric dimension of bilinear forms graphs

2011-04-20

arxiv.org/abs/1104.4089v2

Mathematics

Combinatorics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On the metric dimension of bilinear forms graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the metric dimension of bilinear forms graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the metric dimension of bilinear forms graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-433592