arXiv Analytics

Sign in

arXiv:1608.05495 [math.CO]AbstractReferencesReviewsResources

The fractional strong metric dimension in three graph products

Cong X. Kang, Ismael G. Yero, Eunjeong Yi

Published 2016-08-19Version 1

For any two distinct vertices $x$ and $y$ of a graph $G$, let $S\{x, y\}$ denote the set of vertices $z$ such that either $x$ lies on a $y-z$ geodesic or $y$ lies on an $x-z$ geodesic. Let $g: V(G) \rightarrow [0,1]$ be a real valued function and, for any $U \subseteq V(G)$, let $g(U)=\sum_{v \in U}g(v)$. The function $g$ is a strong resolving function of $G$ if $g(S\{x, y\}) \ge 1$ for every pair of distinct vertices $x, y$ of $G$. The fractional strong metric dimension, $sdim_f(G)$, of a graph $G$ is $\min\{g(V(G)): g \mbox{ is a strong resolving function of }G\}$. In this paper, after obtaining some new results for all connected graphs, we focus on the study of the fractional strong metric dimension of the corona product, the lexicographic product, and the Cartesian product of graphs.

Related articles: Most relevant | Search more
arXiv:1507.04800 [math.CO] (Published 2015-07-16)
Distance preserving graphs and graph products
arXiv:1708.02414 [math.CO] (Published 2017-08-08)
Strong geodetic problem on Cartesian products of graphs
arXiv:1504.01975 [math.CO] (Published 2015-04-08)
On the b-chromatic number of the Cartesian product of two complete graphs