Resolvability and strong resolvability in the direct product of graphs
DOI10.1007/s00025-016-0563-6zbMath1356.05038arXiv1508.03447OpenAlexW2964035583MaRDI QIDQ511842
Dorota Kuziak, Iztok Peterin, Ismael González Yero
Publication date: 22 February 2017
Published in: Results in Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1508.03447
Cartesian productstotal dominationgrid graphmetric dimensionstrong metric dimensionstrong resolving graphdirect product of graphs
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
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Closed formulae for the strong metric dimension of lexicographic product graphs
- On the strong metric dimension of Cartesian and direct products of graphs
- On the metric dimension of corona product graphs
- The strong metric dimension of graphs and digraphs
- On the geodetic number and related metric sets in Cartesian product 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
- Erratum to ``On the strong metric dimension of the strong products of graphs
- Landmarks in graphs
- The metric dimension of strong product graphs
- The Kronecker Product of Graphs
- Searching for geodetic boundary vertex sets
- On the Metric Dimension of Cartesian Products of Graphs
- The Categorical Product of Graphs
- On Metric Generators of Graphs
- Computing the metric dimension of the categorial product of some graphs
- The metric dimension of the lexicographic product of graphs
- The metric dimension of the lexicographic product of graphs
This page was built for publication: Resolvability and strong resolvability in the direct product of graphs