The simultaneous strong metric dimension of graph families
From MaRDI portal
Publication:726509
DOI10.1007/s40840-015-0268-0zbMath1339.05088arXiv1504.04820OpenAlexW750642665WikidataQ57974206 ScholiaQ57974206MaRDI QIDQ726509
Yunior Ramírez-Cruz, Alejandro Estrada-Moreno, Juan Alberto Rodríguez-Velázquez, C. García Gómez
Publication date: 11 July 2016
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.04820
Trees (05C05) Distance in graphs (05C12) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items
Bounds for metric dimension and defensive $k$-alliance of graphs under deleted lexicographic product, Strong resolving graphs: the realization and the characterization problems, Mixed metric dimension of graphs, The Local metric dimension of the lexicographic product of graphs, On the \(k\)-partition dimension of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Simultaneous resolvability in graph families
- 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
- The strong metric dimension of graphs and digraphs
- The simultaneous metric dimension of graph families
- On the geodetic number and related metric sets in Cartesian product graphs
- Depth-first search and the vertex cover problem
- Resolvability in graphs and the metric dimension of a graph
- 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
- Erratum to ``On the strong metric dimension of the strong products of graphs
- On strong metric dimension of graphs and their complements
- Landmarks in graphs
- Variable neighborhood search for the strong metric dimension problem
- Searching for geodetic boundary vertex sets
- Computing strong metric dimension of some special classes of graphs by genetic algorithms
- Structure-activity maps for visualizing the graph variables arising in drug design
- Reducibility among Combinatorial Problems
- Fibonacci heaps and their uses in improved network optimization algorithms
- Minimal doubly resolving sets and the strong metric dimension of Hamming graphs
- On Metric Generators of Graphs
