On the strong metric dimension of Cartesian and direct products of graphs

DOI10.1016/j.disc.2014.06.023zbMath1298.05280arXiv1307.4722OpenAlexW2066705994WikidataQ57974258 ScholiaQ57974258MaRDI QIDQ400431

Ortrud R. Oellermann, Dorota Kuziak, Ismael González Yero, Juan Alberto Rodríguez-Velázquez

Publication date: 21 August 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

strong metric dimensionCartesian products of graphsdirect products of graphsstrong resolving graphstrong resolving set

Mathematics Subject Classification ID

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

Related Items (18)

The \(k\)-metric dimension of the lexicographic product of graphs ⋮ The fractional strong metric dimension in three graph products ⋮ Geodesic transversal problem for join and lexicographic product of graphs ⋮ On the fractional strong metric dimension of graphs ⋮ Closed formulae for the strong metric dimension of lexicographic product graphs ⋮ Strong resolving graphs: the realization and the characterization problems ⋮ The strong metric dimension of some generalized Petersen graphs ⋮ The local complement metric dimension of graphs ⋮ On the geodesic identification of vertices in convex plane graphs ⋮ Comparing the metric and strong dimensions of graphs ⋮ Resolvability and strong resolvability in the direct product of graphs ⋮ On optimal approximability results for computing the strong metric dimension ⋮ Strong metric dimension of rooted product graphs ⋮ The general position problem and strong resolving graphs ⋮ The simultaneous strong metric dimension of graph families ⋮ Strong resolving partitions for strong product graphs and Cartesian product graphs ⋮ Bounds on the sum of broadcast domination number and strong metric dimension of graphs ⋮ A short note on: there is no graph \(G\) with \(G_{\mathrm{SR}} \cong\)\(K_{r, s},\ r, s \geq 2\)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Independent sets in direct products of vertex-transitive graphs
• A note on the partition dimension of Cartesian product graphs
• On the metric dimension of corona product graphs
• The \(k\)-independence number of direct products of graphs and Hedetniemi's conjecture
• The strong metric dimension of graphs and digraphs
• On the geodetic number and related metric sets in Cartesian product graphs
• Resolvability and the upper dimension of graphs
• Resolvability in graphs and the metric dimension of a graph
• On the metric dimension of infinite graphs
• Conditional resolvability in graphs: a survey
• Boundary vertices in graphs
• On the strong metric dimension of corona product graphs and join graphs
• The partition dimension of a graph
• Extremal graph theory for metric dimension and diameter
• The partition dimension of Cayley digraphs
• Locating and total dominating sets in trees
• Independence and coloring properties of direct products of some vertex-transitive graphs
• Discrepancies between metric dimension and partition dimension of a connected graph
• Landmarks in graphs
• On the metric dimension of some families of graphs
• Searching for geodetic boundary vertex sets
• Metric bases in digital geometry
• Structure-activity maps for visualizing the graph variables arising in drug design
• Resolving domination in graphs
• Minimal doubly resolving sets and the strong metric dimension of Hamming graphs
• The Categorical Product of Graphs
• On Metric Generators of Graphs
• Independence numbers of product graphs

This page was built for publication: On the strong metric dimension of Cartesian and direct products of graphs