On the ensemble of optimal identifying codes in a twin-free graph (Q267807): Difference between revisions

@@ Property / cites work @@
+Minimizing the size of an identifying or locating-dominating code in a graph is NP-hard.
+Normal rank
@@ Property / cites work @@
+Q4342497
@@ Property / cites work: Q4342497 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5315023
@@ Property / cites work: Q5315023 / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs where every k-subset of vertices is an identifying set
+Normal rank
@@ Property / cites work @@
+On the number of optimal identifying codes in a twin-free graph
+Normal rank
@@ Property / cites work @@
+On the ensemble of optimal dominating and locating-dominating codes in a graph
+Normal rank
@@ Property / cites work @@
+On a new class of codes for identifying vertices in graphs
+Normal rank
@@ Property / cites work @@
+Q4146667
@@ Property / cites work: Q4146667 / rank @@
+Normal rank
@@ Property / cites work @@
+Induced subgraphs of Johnson graphs
@@ Property / cites work: Induced subgraphs of Johnson graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On \((r,\leq 2)\)-locating-dominating codes in the infinite King grid
+Normal rank