11,591 research outputs found

    The Simultaneous Metric Dimension of Families Composed by Lexicographic Product Graphs

    Full text link
    Let G{\mathcal G} be a graph family defined on a common (labeled) vertex set VV. A set SVS\subseteq V is said to be a simultaneous metric generator for G{\cal G} if for every GGG\in {\cal G} and every pair of different vertices u,vVu,v\in V there exists sSs\in S such that dG(s,u)dG(s,v)d_{G}(s,u)\ne d_{G}(s,v), where dGd_{G} denotes the geodesic distance. A simultaneous adjacency generator for G{\cal G} is a simultaneous metric generator under the metric dG,2(x,y)=min{dG(x,y),2}d_{G,2}(x,y)=\min\{d_{G}(x,y),2\}. A minimum cardinality simultaneous metric (adjacency) generator for G{\cal G} is a simultaneous metric (adjacency) basis, and its cardinality the simultaneous metric (adjacency) dimension of G{\cal G}. Based on the simultaneous adjacency dimension, we study the simultaneous metric dimension of families composed by lexicographic product graphs
    corecore