On strong metric dimension of graphs and their complements
From MaRDI portal
Publication:2391996
DOI10.1007/s10114-013-2365-zzbMath1269.05031OpenAlexW2130406510MaRDI QIDQ2391996
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
Related Items
Closed formulae for the strong metric dimension of lexicographic product graphs ⋮ Fault-tolerant strong metric dimension of graphs ⋮ Strong resolving graphs: the realization and the characterization problems ⋮ The strong metric dimension of some generalized Petersen graphs ⋮ On the geodesic identification of vertices in convex plane graphs ⋮ On optimal approximability results for computing the strong metric dimension ⋮ The simultaneous strong metric dimension of graph families ⋮ On the commuting graph of semidihedral group ⋮ 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
- The strong metric dimension of graphs and digraphs
- The effect of vertex or edge deletion on the metric dimension of graphs
- Resolvability in graphs and the metric dimension of a graph
- On the strong metric dimension of corona product graphs and join graphs
- Extremal graph theory for metric dimension and diameter
- Landmarks in graphs
- Characterization of n-Vertex Graphs with Metric Dimension n-3
- Metric Dimension and Zero Forcing Number of Two Families of Line Graphs
- Base size, metric dimension and other invariants of groups and graphs
- On Complementary Graphs
- On the Metric Dimension of Cartesian Products of Graphs
- On Metric Generators of Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
