Strong resolving graphs: the realization and the characterization problems
From MaRDI portal
Publication:1693153
DOI10.1016/j.dam.2017.11.013zbMath1377.05095arXiv1612.02843OpenAlexW2963883049MaRDI QIDQ1693153
María Luz Puertas, Dorota Kuziak, Juan Alberto Rodríguez-Velázquez, Ismael González Yero
Publication date: 11 January 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1612.02843
Related Items (10)
The fractional strong metric dimension in three graph products ⋮ Strong resolving graph of a zero-divisor graph ⋮ Further new results on strong resolving partitions for graphs ⋮ Metric Properties of Non-Commuting Graph Associated to Two Groups ⋮ On the geodesic identification of vertices in convex plane graphs ⋮ The general position problem and strong resolving graphs ⋮ The threshold strong dimension of a graph ⋮ A short note on: there is no graph \(G\) with \(G_{\mathrm{SR}} \cong\)\(K_{r, s},\ r, s \geq 2\) ⋮ The threshold dimension and threshold strong dimension of a graph: a survey ⋮ General d-position sets
Cites Work
- On the fractional strong metric dimension of graphs
- Closed formulae for the strong metric dimension of lexicographic product graphs
- On the strong metric dimension of Cartesian and direct products of graphs
- Minimal doubly resolving sets and the strong metric dimension of some convex polytopes
- Resolvability and strong resolvability in the direct product of graphs
- On optimal approximability results for computing the strong metric dimension
- Graphs with four boundary vertices
- The simultaneous strong metric dimension of graph families
- The strong metric dimension of graphs and digraphs
- Lower bounding the boundary of a graph in terms of its maximum or minimum degree
- On the geodetic number and related metric sets in Cartesian product graphs
- On the chromatic number of the lexicographic product and the Cartesian sum of graphs
- Boundary vertices in graphs
- On the strong metric dimension of corona product graphs and join graphs
- On the strong metric dimension of the strong products of graphs
- On strong metric dimension of graphs and their complements
- On the corona of two graphs
- Variable neighborhood search for the strong metric dimension problem
- The Fractional Strong Metric Dimension of Graphs
- Strong metric dimension: A survey
- On the Strong Metric Dimension of Cartesian Sum Graphs
- The Kronecker Product of Graphs
- Searching for geodetic boundary vertex sets
- Computing strong metric dimension of some special classes of graphs by genetic algorithms
- The strong metric dimension of generalized Sierpiński graphs with pendant vertices
- Minimal doubly resolving sets and the strong metric dimension of Hamming graphs
- The Categorical Product of Graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Strong resolving graphs: the realization and the characterization problems
