2011/05/10 by Jun Guo, Guo, Jun, Kaishun Wang +3
Computer Science · Mathematics · #Graph Labeling and Dimension Problems #math.CO
paper · pdf · doi:10.48550/arxiv.1105.1847
arxiv created 2011/05/10 · arxiv updated 2011/05/11
A resolving set of a graph is a set of vertices with the property that the list of distances from any vertex to those in the set uniquely identifies that vertex. In this paper, we construct a resolving set of Johnson graphs, doubled Odd graphs, doubled Grassmann graphs and twisted Grassmann graphs, respectively, and obtain the upper bounds on the metric dimension of these graphs.