Computing the local metric dimension of a graph from the local metric dimension of primary subgraphs
DOI10.1080/00207160.2014.918608zbMath1320.05031arXiv1402.0177OpenAlexW2046822022WikidataQ57974232 ScholiaQ57974232MaRDI QIDQ5259067
C. García Gómez, Gabriel A. Barragán-Ramírez, Juan Alberto Rodríguez-Velázquez
Publication date: 24 June 2015
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1402.0177
Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)
Related Items (9)
Cites Work
- Resolvability and the upper dimension of graphs
- Resolvability in graphs and the metric dimension of a graph
- On the decomposition dimension of trees
- The partition dimension of a graph
- The partition dimension of Cayley digraphs
- Locating and total dominating sets in trees
- On the corona of two graphs
- Landmarks in graphs
- On the Metric Dimension of Cartesian Products of Graphs
- Metric bases in digital geometry
- A new graph product and its spectrum
- Structure-activity maps for visualizing the graph variables arising in drug design
- The decomposition dimension of graphs
This page was built for publication: Computing the local metric dimension of a graph from the local metric dimension of primary subgraphs