Identifying codes of corona product graphs (Q2449061): Difference between revisions

@@ Property / OpenAlex ID @@
+W2088144753
@@ Property / OpenAlex ID: W2088144753 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.4295
@@ Property / arXiv ID: 1301.4295 / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity results for identifying codes in planar graphs
+Normal rank
@@ Property / cites work @@
+Exact Minimum Density of Codes Identifying Vertices in the Square Grid
+Normal rank
@@ Property / cites work @@
+Identifying and locating-dominating codes on chains and cycles
+Normal rank
@@ Property / cites work @@
+Q4948746
@@ Property / cites work: Q4948746 / rank @@
+Normal rank
@@ Property / cites work @@
+The minimum density of an identifying code in the king lattice.
+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 @@
+Identifying codes and locating-dominating sets on paths and cycles
+Normal rank
@@ Property / cites work @@
+Q2717197
@@ Property / cites work: Q2717197 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3619797
@@ Property / cites work: Q3619797 / rank @@
+Normal rank
@@ Property / cites work @@
+A new lower bound on the density of vertex identifying codes for the infinite hexagonal grid
+Normal rank
@@ Property / cites work @@
+Improved bounds on identifying codes in binary Hamming spaces
+Normal rank
@@ Property / cites work @@
+Identifying codes of lexicographic product of graphs
+Normal rank
@@ Property / cites work @@
+On the size of identifying codes in triangle-free graphs
+Normal rank
@@ Property / cites work @@
+Identifying codes of cycles
@@ Property / cites work: Identifying codes of cycles / rank @@
+Normal rank
@@ Property / cites work @@
+Identifying codes of Cartesian product of two cliques of the same size
+Normal rank
@@ Property / cites work @@
+Q4368728
@@ Property / cites work: Q4368728 / rank @@
+Normal rank
@@ Property / cites work @@
+An optimal strongly identifying code in the infinite triangular grid
+Normal rank
@@ Property / cites work @@
+On Identifying Codes in the Triangular and Square Grids
+Normal rank
@@ Property / cites work @@
+On identifying codes in binary Hamming spaces
@@ Property / cites work: On identifying codes in binary Hamming spaces / rank @@
+Normal rank
@@ Property / cites work @@
+On the size of identifying codes in binary hypercubes
+Normal rank
@@ Property / cites work @@
+Optimal identifying codes in cycles and paths
@@ Property / cites work: Optimal identifying codes in cycles and paths / rank @@
+Normal rank
@@ Property / cites work @@
+On a new class of codes for identifying vertices in graphs
+Normal rank
@@ Property / cites work @@
+On the covering of vertices for fault diagnosis in hypercubes
+Normal rank
@@ Property / cites work @@
+Q5393489
@@ Property / cites work: Q5393489 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for identifying codes in some infinite grids
+Normal rank
@@ Property / cites work @@
+Monotonicity of the minimum cardinality of an identifying code in the hypercube
+Normal rank
@@ Property / cites work @@
+On \((r,\leq 2)\)-locating-dominating codes in the infinite King grid
+Normal rank
@@ Property / cites work @@
+Identifying codes of the direct product of two cliques
+Normal rank
@@ Property / cites work @@
+On the identification problems in products of cycles
+Normal rank
@@ Property / cites work @@
+Improved Bounds for<i>r</i>-Identifying Codes of the Hex Grid
+Normal rank
@@ Property / cites work @@
+Vertex identifying codes for the n-dimensional lattice
+Normal rank
@@ Property / cites work @@
+Identifying codes of cycles with odd orders
@@ Property / cites work: Identifying codes of cycles with odd orders / rank @@
+Normal rank