420 research outputs found
On the strong metric dimension of Cartesian sum graphs
A vertex of a connected graph strongly resolves two vertices , if there exists some shortest path containing or some shortest
path containing . A set of vertices is a strong metric generator
for if every pair of vertices of is strongly resolved by some vertex of
. The smallest cardinality of a strong metric generator for is called
the strong metric dimension of . In this paper we obtain several tight
bounds or closed formulae for the strong metric dimension of the Cartesian sum
of graphs in terms of the strong metric dimension, clique number or twins-free
clique number of its factor graphs.Comment: arXiv admin note: text overlap with arXiv:1402.266
Computing the metric dimension of a graph from primary subgraphs
Let be a connected graph. Given an ordered set and a vertex , the representation of with
respect to is the ordered -tuple
, where denotes the distance between and . The
set is a metric generator for if every two different vertices of
have distinct representations. A minimum cardinality metric generator is called
a \emph{metric basis} of and its cardinality is called the \emph{metric
dimension} of G. It is well known that the problem of finding the metric
dimension of a graph is NP-Hard. In this paper we obtain closed formulae for
the metric dimension of graphs with cut vertices. The main results are applied
to specific constructions including rooted product graphs, corona product
graphs, block graphs and chains of graphs.Comment: 18 page
Simultaneous Resolvability in Families of Corona Product Graphs
Let be a graph family defined on a common vertex set and let
be a distance defined on every graph . A set is
said to be a simultaneous metric generator for if for every and every pair of different vertices there exists
such that . The simultaneous metric dimension of
is the smallest integer such that there is a simultaneous metric generator
for of cardinality . We study the simultaneous metric dimension
of families composed by corona product graphs. Specifically, we focus on the
case of two particular distances defined on every , namely, the
geodesic distance and the distance defined as .Comment: arXiv admin note: substantial text overlap with arXiv:1504.0049
The local metric dimension of the lexicographic product of graphs
The metric dimension is quite a well-studied graph parameter. Recently, the
adjacency dimension and the local metric dimension have been introduced and
studied. In this paper, we give a general formula for the local metric
dimension of the lexicographic product of a connected
graph of order and a family composed by graphs. We
show that the local metric dimension of can be expressed
in terms of the true twin equivalence classes of and the local adjacency
dimension of the graphs in
On the adjacency dimension of graphs
A generator of a metric space is a set of points in the space with the
property that every point of the space is uniquely determined by its distances
from the elements of . Given a simple graph , we define the
distance function , as
where is the length of a shortest
path between and and is the set of positive integers. Then
is a metric space. We say that a set is a
-adjacency generator for if for every two vertices , there
exist at least vertices such that
d_{G,2}(x,w_i)\ne d_{G,2}(y,w_i),\; \mbox{for every}\; i\in \{1,...,k\}. A
minimum cardinality -adjacency generator is called a -adjacency basis of
and its cardinality, the -adjacency dimension of .
In this article we study the problem of finding the -adjacency dimension
of a graph. We give some necessary and sufficient conditions for the existence
of a -adjacency basis of an arbitrary graph and we obtain general
results on the -adjacency dimension, including general bounds and closed
formulae for some families of graphs. In particular, we obtain closed formulae
for the -adjacency dimension of join graphs in terms of the
-adjacency dimension of and . These results concern the -metric
dimension, as join graphs have diameter two. As we can expect, the obtained
results will become important tools for the study of the -metric dimension
of lexicographic product graphs and corona product graphs
The -metric dimension of corona product graphs
Given a connected simple graph , and a positive integer , a set
is said to be a -metric generator for if and only if for
any pair of different vertices , there exist at least vertices
such that , for every , where is the length of a shortest path between and
. A -metric generator of minimum cardinality in is called a
-metric basis and its cardinality, the -metric dimension of . In this
article we study the -metric dimension of corona product graphs
, where is a graph of order and is a
family of non-trivial graphs. Specifically, we give some necessary and
sufficient conditions for the existence of a -metric basis in a connected
corona graph. Moreover, we obtain tight bounds and closed formulae for the
-metric dimension of connected corona graphs.Comment: 22 page
The k-metric dimension of graphs: a general approach
Let be a metric space. A set is said to be a
-metric generator for if and only if for any pair of different points
, there exist at least points such
that d(u,w_i)\ne d(v,w_i),\; \mbox{\rm for all}\; i\in \{1, \ldots k\}. Let
be the set of metric generators for . The -metric
dimension of is defined as Here, we discuss the -metric dimension of ,
where is the set of vertices of a simple graph and the metric
is defined by
from the geodesic distance in and a
positive integer . The case , where denotes the diameter
of , corresponds to the original theory of -metric dimension and the case
corresponds to the theory of -adjacency dimension. Furthermore, this
approach allows us to extend the theory of -metric dimension to the general
case of non-necessarily connected graphs
The -metric dimension of the lexicographic product of graphs
Given a simple and connected graph , and a positive integer , a
set is said to be a -metric generator for , if for any
pair of different vertices , there exist at least vertices
such that , for every , where denotes the distance between and . The
minimum cardinality of a -metric generator is the -metric dimension of
. A set is a -adjacency generator for if any two
different vertices satisfy , where is the
symmetric difference of the neighborhoods of and . The minimum
cardinality of any -adjacency generator is the -adjacency dimension of
. In this article we obtain tight bounds and closed formulae for the
-metric dimension of the lexicographic product of graphs in terms of the
-adjacency dimension of the factor graphs.Comment: 19 page
The strong metric dimension of some generalized Petersen graphs
In this paper the strong metric dimension of generalized Petersen graphs
is considered. The exact value is determined for cases and
, while for an upper bound of the strong metric dimension is
presented
The Simultaneous Metric Dimension of Families Composed by Lexicographic Product Graphs
Let be a graph family defined on a common (labeled) vertex set
. A set is said to be a simultaneous metric generator for
if for every and every pair of different vertices
there exists such that , where
denotes the geodesic distance. A simultaneous adjacency generator for
is a simultaneous metric generator under the metric
. A minimum cardinality simultaneous metric
(adjacency) generator for is a simultaneous metric (adjacency)
basis, and its cardinality the simultaneous metric (adjacency) dimension of
. Based on the simultaneous adjacency dimension, we study the
simultaneous metric dimension of families composed by lexicographic product
graphs
- …