On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results (Q1693144): Difference between revisions

Latest revision as of 22:10, 14 July 2024

scientific article

Language	Label	Description	Also known as
English	On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results	scientific article

Statements

instance of

scholarly article

0 references

title

On the (adjacency) metric dimension of corona and strong product graphs and their local variants: combinatorial and computational results (English)

0 references

author

Henning Fernau

0 references

Juan Alberto Rodríguez-Velázquez

0 references

published in

Discrete Applied Mathematics

0 references

publication date

11 January 2018

0 references

full work available at URL

https://arxiv.org/abs/1309.2275

0 references

zbMATH Keywords

adjacency dimension

0 references

metric dimension

0 references

local metric dimension

0 references

NP-hardness

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

On the metric dimension of Grassmann graphs

0 references

Tight approximability results for test set problems in bioinformatics

0 references

Approximation algorithms for the test cover problem

0 references

Resolving domination in graphs

0 references

On \(k\)-dimensional graphs and their bases

0 references

On the Metric Dimension of Cartesian Products of Graphs

0 references

The Complexity of Satisfiability of Small Depth Circuits

0 references

Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.

0 references

Resolvability in graphs and the metric dimension of a graph

0 references

The independent resolving number of a graph

0 references

Q3789614

0 references

Complexity of metric dimension on planar graphs

0 references

Fundamentals of parameterized complexity

0 references

On the metric dimension of bilinear forms graphs

0 references

Notions of Metric Dimension of Corona Products: Combinatorial and Computational Results

0 references

Identifying Codes in Line Graphs

0 references

Centroidal bases in graphs

0 references

Identifying path covers in graphs

0 references

On the corona of two graphs

0 references

0 references

0 references

0 references

0 references

Locating and total dominating sets in trees

0 references

On robust and dynamic identifying codes

0 references

Which problems have strongly exponential complexity?

0 references

Q4523707

0 references

Q4647649

0 references

The metric dimension of the lexicographic product of graphs

0 references

Structure-activity maps for visualizing the graph variables arising in drug design

0 references

On a new class of codes for identifying vertices in graphs

0 references

Landmarks in graphs

0 references

Identifying Codes and Covering Problems

0 references

Planar Formulae and Their Uses

0 references

Metric bases in digital geometry

0 references

Q3073427

0 references

On the local metric dimension of corona product graphs

0 references

Conditional resolvability in graphs: a survey

0 references

On Metric Generators of Graphs

0 references

Q4075485

0 references

Approximability of identifying codes and locating-dominating codes

0 references

On the metric dimension of corona product graphs

0 references

Identifiers

zbMATH Open document ID

1377.05048

0 references

DOI

10.1016/j.dam.2017.11.019

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1693144

@@ Property / author @@
-Juan Alberto Rodríguez-Velázquez
@@ Property / author: Juan Alberto Rodríguez-Velázquez / rank @@
-Normal rank
@@ Property / author @@
+Juan Alberto Rodríguez-Velázquez
@@ Property / author: Juan Alberto Rodríguez-Velázquez / rank @@
+Normal rank
@@ Property / Wikidata QID @@
+Q57974175
@@ Property / Wikidata QID: Q57974175 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2964189023
@@ Property / OpenAlex ID: W2964189023 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.2275
@@ Property / arXiv ID: 1309.2275 / rank @@
+Normal rank
@@ Property / cites work @@
+On the metric dimension of Grassmann graphs
@@ Property / cites work: On the metric dimension of Grassmann graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Tight approximability results for test set problems in bioinformatics
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the test cover problem
+Normal rank
@@ Property / cites work @@
+Resolving domination in graphs
@@ Property / cites work: Resolving domination in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On \(k\)-dimensional graphs and their bases
@@ Property / cites work: On \(k\)-dimensional graphs and their bases / rank @@
+Normal rank
@@ Property / cites work @@
+On the Metric Dimension of Cartesian Products of Graphs
+Normal rank
@@ Property / cites work @@
+The Complexity of Satisfiability of Small Depth Circuits
+Normal rank
@@ Property / cites work @@
+Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
+Normal rank
@@ Property / cites work @@
+Resolvability in graphs and the metric dimension of a graph
+Normal rank
@@ Property / cites work @@
+The independent resolving number of a graph
@@ Property / cites work: The independent resolving number of a graph / rank @@
+Normal rank
@@ Property / cites work @@
+Q3789614
@@ Property / cites work: Q3789614 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of metric dimension on planar graphs
@@ Property / cites work: Complexity of metric dimension on planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+On the metric dimension of bilinear forms graphs
@@ Property / cites work: On the metric dimension of bilinear forms graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Notions of Metric Dimension of Corona Products: Combinatorial and Computational Results
+Normal rank
@@ Property / cites work @@
+Identifying Codes in Line Graphs
@@ Property / cites work: Identifying Codes in Line Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Centroidal bases in graphs
@@ Property / cites work: Centroidal bases in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Identifying path covers in graphs
@@ Property / cites work: Identifying path covers in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the corona of two graphs
@@ Property / cites work: On the corona of two graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5572939
@@ Property / cites work: Q5572939 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4119237
@@ Property / cites work: Q4119237 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4368728
@@ Property / cites work: Q4368728 / rank @@
+Normal rank
@@ Property / cites work @@
+Locating and total dominating sets in trees
@@ Property / cites work: Locating and total dominating sets in trees / rank @@
+Normal rank
@@ Property / cites work @@
+On robust and dynamic identifying codes
@@ Property / cites work: On robust and dynamic identifying codes / rank @@
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+Q4523707
@@ Property / cites work: Q4523707 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4647649
@@ Property / cites work: Q4647649 / rank @@
+Normal rank
@@ Property / cites work @@
+The metric dimension of the lexicographic product of graphs
+Normal rank
@@ Property / cites work @@
+Structure-activity maps for visualizing the graph variables arising in drug design
+Normal rank
@@ Property / cites work @@
+On a new class of codes for identifying vertices in graphs
+Normal rank
@@ Property / cites work @@
+Landmarks in graphs
@@ Property / cites work: Landmarks in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Identifying Codes and Covering Problems
@@ Property / cites work: Identifying Codes and Covering Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Planar Formulae and Their Uses
@@ Property / cites work: Planar Formulae and Their Uses / rank @@
+Normal rank
@@ Property / cites work @@
+Metric bases in digital geometry
@@ Property / cites work: Metric bases in digital geometry / rank @@
+Normal rank
@@ Property / cites work @@
+Q3073427
@@ Property / cites work: Q3073427 / rank @@
+Normal rank
@@ Property / cites work @@
+On the local metric dimension of corona product graphs
+Normal rank
@@ Property / cites work @@
+Conditional resolvability in graphs: a survey
@@ Property / cites work: Conditional resolvability in graphs: a survey / rank @@
+Normal rank
@@ Property / cites work @@
+On Metric Generators of Graphs
@@ Property / cites work: On Metric Generators of Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4075485
@@ Property / cites work: Q4075485 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximability of identifying codes and locating-dominating codes
+Normal rank
@@ Property / cites work @@
+On the metric dimension of corona product graphs
@@ Property / cites work: On the metric dimension of corona product graphs / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1693144