On the Strong Metric Dimension of Cartesian Sum Graphs

DOI10.3233/FI-2015-1263MaRDI QIDQ3187017zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Dorota Kuziak, Ismael G. Yero, Juan A. Rodríguez-Velázquez

Publication date 15 August 2016

Published in Fundamenta Informaticae (Search for Journal in Brave)

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

zbMATH Keywords

Cartesian sum graphsstrong metric basisstrong metric dimensionstrong metric generator

Mathematics Subject Classification ID

Distance in graphs (05C12) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Abstract: A vertex $w$ of a connected graph $G$ strongly resolves two vertices $u,vinV(G)$, if there exists some shortest $u-w$ path containing $v$ or some shortest $v-w$ path containing $u$. A set $S$ of vertices is a strong metric generator for $G$ if every pair of vertices of $G$ is strongly resolved by some vertex of $S$. The smallest cardinality of a strong metric generator for $G$ is called the strong metric dimension of $G$. In this paper we obtain several tight bounds or closed formulae for the strong metric dimension of the Cartesian sum of graphs in terms of the strong metric dimension, clique number or twins-free clique number of its factor graphs.

Recommendations

• On the strong metric dimension of Cartesian and direct products of graphs
• The strong metric dimension of graphs and digraphs
• On strong metric dimension of graphs and their complements
• On the strong metric dimension of the strong products of graphs
• The metric dimension of strongly regular graphs
• On the metric dimension of Cartesian products of graphs
• On the Metric Dimension of Cartesian Products of Graphs
• On the metric dimension of Cartesian powers of a graph
• The simultaneous strong metric dimension of graph families
• Comparing the metric and strong dimensions of graphs

Cited in

(6)

• Strong resolving graphs: the realization and the characterization problems
• On the geodesic identification of vertices in convex plane graphs
• On the strong metric dimension of product graphs
• Closed formulae for the strong metric dimension of lexicographic product graphs
• On automorphisms and fixing number of co-normal product of graphs
• Bounds on the domination number and the metric dimension of co-normal product of graphs

This page was built for publication: On the Strong Metric Dimension of Cartesian Sum Graphs

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