Maximum size of a minimum watching system and the graphs achieving the bound (Q496659): Difference between revisions

@@ Property / DOI @@
-.1016/j.dam.2012.08.028
@@ Property / DOI: 10.1016/j.dam.2012.08.028 / rank @@
-Normal rank
@@ Property / cites work @@
+Watching systems in graphs: an extension of identifying codes
+Normal rank
@@ Property / cites work @@
+Maximum size of a minimum watching system and the graphs achieving the bound
+Normal rank
@@ Property / cites work @@
+Extremal cardinalities for identifying and locating-dominating codes in graphs
+Normal rank
@@ Property / cites work @@
+Extremal graphs for the identifying code problem
@@ Property / cites work: Extremal graphs for the identifying code problem / rank @@
+Normal rank
@@ Property / cites work @@
+On graphs having a \(V\setminus \{x\}\) set as an identifying code
+Normal rank
@@ Property / cites work @@
+Q5429563
@@ Property / cites work: Q5429563 / rank @@
+Normal rank
@@ Property / cites work @@
+On a new class of codes for identifying vertices in graphs
+Normal rank
@@ Property / cites work @@
+On the identification of vertices using cycles
@@ Property / cites work: On the identification of vertices using cycles / rank @@
+Normal rank
@@ Property / cites work @@
+Q4774085
@@ Property / cites work: Q4774085 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4443440
@@ Property / cites work: Q4443440 / rank @@
+Normal rank
@@ Property / DOI @@
+.1016/J.DAM.2012.08.028
@@ Property / DOI: 10.1016/J.DAM.2012.08.028 / rank @@
+Normal rank