On strong metric dimension of graphs and their complements
From MaRDI portal
Publication:2391996
DOI10.1007/S10114-013-2365-ZzbMATH Open1269.05031OpenAlexW2130406510MaRDI QIDQ2391996FDOQ2391996
Authors: Eunjeong Yi
Publication date: 6 August 2013
Published in: Acta Mathematica Sinica, English Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10114-013-2365-z
Recommendations
Cites Work
- Title not available (Why is that?)
- Resolvability in graphs and the metric dimension of a graph
- Base size, metric dimension and other invariants of groups and graphs
- On the Metric Dimension of Cartesian Products of Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the strong metric dimension of corona product graphs and join graphs
- Landmarks in graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- On Metric Generators of Graphs
- The strong metric dimension of graphs and digraphs
- Extremal graph theory for metric dimension and diameter
- On Complementary Graphs
- On metric dimension of graphs and their complements
- Metric Dimension and Zero Forcing Number of Two Families of Line Graphs
- The effect of vertex or edge deletion on the metric dimension of graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Characterization of \(n\)-vertex graphs with metric dimension \({n-3}\).
Cited In (16)
- On metric dimension of graphs and their complements
- On the geodesic identification of vertices in convex plane graphs
- Strong Isometric Dimension, Biclique Coverings, and Sperner's Theorem
- On the commuting graph of semidihedral group
- Strong resolving graphs: the realization and the characterization problems
- Computing strong metric dimension of some special classes of graphs by genetic algorithms
- The simultaneous strong metric dimension of graph families
- Metric and strong metric dimension in cozero-divisor graphs
- On optimal approximability results for computing the strong metric dimension
- On the Strong Metric Dimension of Cartesian Sum Graphs
- A short note on: there is no graph \(G\) with \(G_{\mathrm{SR}} \cong\)\(K_{r, s},\ r, s \geq 2\)
- The strong metric dimension of some generalized Petersen graphs
- Closed formulae for the strong metric dimension of lexicographic product graphs
- THE STRONG CONNECTED METRIC DIMENSION IN THE JOIN AND CORONA OF GRAPHS
- Fault-tolerant strong metric dimension of graphs
- Bounds on the sum of broadcast domination number and strong metric dimension of graphs
This page was built for publication: On strong metric dimension of graphs and their complements
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2391996)