 resolves a graph
 resolves a graph  if every vertex is uniquely
determined by its vector of distances to the vertices in
 if every vertex is uniquely
determined by its vector of distances to the vertices in  .  A metric
dimension of
.  A metric
dimension of  is the minimum cardinality of a resolving set of
 is the minimum cardinality of a resolving set of  . A
bipartite graph
. A
bipartite graph  is a graph whose vertex set
 is a graph whose vertex set  can be partitioned
into two subsets
 can be partitioned
into two subsets  and
 and  with
 with 
 such that every edge
of
 such that every edge
of  joins
 joins  and
 and  . The graph
. The graph  is called
 is called  -regular if every
vertex of
-regular if every
vertex of  is adjacent to
 is adjacent to  other vertices.  In this paper, we
determine the metric dimension of
 other vertices.  In this paper, we
determine the metric dimension of  -regular bipartite graphs
-regular bipartite graphs  where
where  or
 or  .
. 
Key Words: Metric dimension, basis, bipartite graph, regular graph.
2000 Mathematics Subject Classification: Primary: 05C12;
Secondary: 05C15, 05C62.
Download the paper in pdf format here.