Improved upper bounds for identifying codes in \(n\)-dimensional \(q\)-ary cubes (Q2186954): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s40819-020-0795-8
+Normal rank
@@ Property / OpenAlex ID @@
+W3009187292
@@ Property / OpenAlex ID: W3009187292 / rank @@
+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 @@
+Q4659582
@@ Property / cites work: Q4659582 / rank @@
+Normal rank
@@ Property / cites work @@
+Identifying codes and locating-dominating sets on paths and cycles
+Normal rank
@@ Property / cites work @@
+Identifying codes of corona product graphs
@@ Property / cites work: Identifying codes of corona product graphs / rank @@
+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 @@
+Q5298903
@@ Property / cites work: Q5298903 / rank @@
+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 @@
+Q3005852
@@ Property / cites work: Q3005852 / rank @@
+Normal rank
@@ Property / cites work @@
+On identifying codes in the Cartesian product of a path and a complete graph
+Normal rank
@@ Property / cites work @@
+Distance domination in graphs with given minimum and maximum degree
+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 @@
+Q5393489
@@ Property / cites work: Q5393489 / 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 @@
+Q3517160
@@ Property / cites work: Q3517160 / rank @@
+Normal rank
@@ Property / cites work @@
+Identifying codes of the direct product of two cliques
+Normal rank
@@ Property / cites work @@
+On minimum identifying codes in some Cartesian product graphs
+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
@@ links / mardi / name / links / mardi / name @@
+Publication:2186954