21 research outputs found
Metric dimension of dual polar graphs
A resolving set for a graph is a collection of vertices , chosen
so that for each vertex , the list of distances from to the members of
uniquely specifies . The metric dimension is the smallest
size of a resolving set for . We consider the metric dimension of the
dual polar graphs, and show that it is at most the rank over of
the incidence matrix of the corresponding polar space. We then compute this
rank to give an explicit upper bound on the metric dimension of dual polar
graphs.Comment: 8 page
Metric Dimension of Amalgamation of Graphs
A set of vertices resolves a graph if every vertex is uniquely
determined by its vector of distances to the vertices in . The metric
dimension of is the minimum cardinality of a resolving set of .
Let be a finite collection of graphs and each
has a fixed vertex or a fixed edge called a terminal
vertex or edge, respectively. The \emph{vertex-amalgamation} of , denoted by , is formed by taking all
the 's and identifying their terminal vertices. Similarly, the
\emph{edge-amalgamation} of , denoted by
, is formed by taking all the 's and identifying
their terminal edges.
Here we study the metric dimensions of vertex-amalgamation and
edge-amalgamation for finite collection of arbitrary graphs. We give lower and
upper bounds for the dimensions, show that the bounds are tight, and construct
infinitely many graphs for each possible value between the bounds.Comment: 9 pages, 2 figures, Seventh Czech-Slovak International Symposium on
Graph Theory, Combinatorics, Algorithms and Applications (CSGT2013), revised
version 21 December 201
On Metric Dimension of Functigraphs
The \emph{metric dimension} of a graph , denoted by , is the
minimum number of vertices such that each vertex is uniquely determined by its
distances to the chosen vertices. Let and be disjoint copies of a
graph and let be a function. Then a
\emph{functigraph} has the vertex set
and the edge set . We study how
metric dimension behaves in passing from to by first showing that
, if is a connected graph of order
and is any function. We further investigate the metric dimension of
functigraphs on complete graphs and on cycles.Comment: 10 pages, 7 figure