2 research outputs found
A Comparison between the Zero Forcing Number and the Strong Metric Dimension of Graphs
The \emph{zero forcing number}, , of a graph is the minimum
cardinality of a set of black vertices (whereas vertices in are
colored white) such that is turned black after finitely many
applications of "the color-change rule": a white vertex is converted black if
it is the only white neighbor of a black vertex. The \emph{strong metric
dimension}, , of a graph is the minimum among cardinalities of all
strong resolving sets: is a \emph{strong resolving set} of
if for any , there exists an such that either
lies on an geodesic or lies on an geodesic. In this paper, we
prove that for a connected graph , where is
the cycle rank of . Further, we prove the sharp bound
when is a tree or a unicyclic graph, and we characterize trees
attaining . It is easy to see that can be
arbitrarily large for a tree ; we prove that and
show that the bound is sharp.Comment: 8 pages, 5 figure