Monotonicity of the minimum cardinality of an identifying code in the hypercube (Q2492191): Difference between revisions

@@ Property / DOI @@
-.1016/j.dam.2005.05.030
@@ Property / DOI: 10.1016/j.dam.2005.05.030 / rank @@
-Normal rank
@@ 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.1016/j.dam.2005.05.030
+Normal rank
@@ Property / OpenAlex ID @@
+W2028229839
@@ Property / OpenAlex ID: W2028229839 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4948746
@@ Property / cites work: Q4948746 / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds on identifying codes
@@ Property / cites work: Bounds on identifying codes / rank @@
+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 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 / DOI @@
+.1016/J.DAM.2005.05.030
@@ Property / DOI: 10.1016/J.DAM.2005.05.030 / rank @@
+Normal rank