The simultaneous metric dimension of families composed by lexicographic product graphs

DOI10.1007/S00373-016-1675-1MaRDI QIDQ343771zbMATH OpenOpenAlexWikidataFDO

Authors Yunior Ramírez-Cruz, Alejandro Estrada-Moreno, Juan A. Rodríguez-Velázquez

Publication date 29 November 2016

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1504.00492

zbMATH Keywords

lexicographic product graphssimultaneous metric dimensionsimultaneous adjacency dimension

Mathematics Subject Classification ID

Distance in graphs (05C12) Structural characterization of families of graphs (05C75) Graph operations (line graphs, products, etc.) (05C76)

Abstract: Let $mathcalG$ be a graph family defined on a common (labeled) vertex set $V$. A set $SsubseteqV$ is said to be a simultaneous metric generator for $calG$ if for every $GincalG$ and every pair of different vertices $u,vinV$ there exists $sinS$ such that $d_G(s,u)e{d}_G(s,v)$, where $d_G$ denotes the geodesic distance. A simultaneous adjacency generator for $calG$ is a simultaneous metric generator under the metric $d_{G,2}(x,y)=min{d}_G(x,y),2$. A minimum cardinality simultaneous metric (adjacency) generator for $calG$ is a simultaneous metric (adjacency) basis, and its cardinality the simultaneous metric (adjacency) dimension of $calG$. Based on the simultaneous adjacency dimension, we study the simultaneous metric dimension of families composed by lexicographic product graphs.

Recommendations

• Simultaneous resolvability in graph families
• The simultaneous metric dimension of graph families
• Simultaneous resolvability in families of corona product graphs
• The simultaneous local metric dimension of graph families
• The simultaneous strong metric dimension of graph families

Cites work

• scientific article; zbMATH DE number 3494441 (Why is no real title available?)
• scientific article; zbMATH DE number 3544092 (Why is no real title available?)
• Factor domination in graphs
• Handbook of product graphs
• Landmarks in graphs
• Notions of metric dimension of corona products: combinatorial and computational results
• On Metric Generators of Graphs
• On classes of regular graphs with constant metric dimension
• On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results
• On the adjacency dimension of graphs
• Resolving domination in graphs
• Simultaneous resolvability in graph families
• Structure-activity maps for visualizing the graph variables arising in drug design
• The \(k\)-metric dimension of corona product graphs
• The independent resolving number of a graph
• The local metric dimension of a graph
• The metric dimension of the lexicographic product of graphs
• The simultaneous metric dimension of graph families

Cited in

(10)

• The simultaneous metric dimension of graph families
• The adjacency dimension of graphs
• Simultaneous resolvability in graph families
• The metric dimension of the lexicographic product of graphs
• Simultaneous resolvability in families of corona product graphs
• The simultaneous strong metric dimension of graph families
• The Local metric dimension of the lexicographic product of graphs
• Bounds for metric dimension and defensive $k$-alliance of graphs under deleted lexicographic product
• On the \(k\)-partition dimension of graphs
• The simultaneous local metric dimension of graph families

This page was built for publication: The simultaneous metric dimension of families composed by lexicographic product graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q343771)