Minimum sizes of identifying codes in graphs differing by one vertex (Q2392684): 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/s12095-012-0078-2
+Normal rank
@@ Property / OpenAlex ID @@
+W4244127482
@@ Property / OpenAlex ID: W4244127482 / rank @@
+Normal rank
@@ Property / cites work @@
+Identifying and locating-dominating codes on chains and cycles
+Normal rank
@@ Property / cites work @@
+Structural properties of twin-free graphs
@@ Property / cites work: Structural properties of twin-free graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum sizes of identifying codes in graphs differing by one edge
+Normal rank
@@ Property / cites work @@
+On the Structure of Identifiable Graphs
@@ Property / cites work: On the Structure of Identifiable Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Extremal cardinalities for identifying and locating-dominating codes in graphs
+Normal rank
@@ Property / cites work @@
+Identifying codes and locating-dominating sets on paths and cycles
+Normal rank
@@ Property / cites work @@
+Q5315023
@@ Property / cites work: Q5315023 / rank @@
+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 @@
+Q3534283
@@ Property / cites work: Q3534283 / rank @@
+Normal rank
@@ Property / cites work @@
+On graphs having a \(V\setminus \{x\}\) set as an identifying code
+Normal rank
@@ Property / cites work @@
+An optimal edge-robust identifying code in the triangular lattice
+Normal rank
@@ Property / cites work @@
+Q3412137
@@ Property / cites work: Q3412137 / rank @@
+Normal rank
@@ Property / cites work @@
+On identifying codes that are robust against edge changes
+Normal rank
@@ Property / cites work @@
+On a new class of codes for identifying vertices in graphs
+Normal rank
@@ Property / cites work @@
+Optimal \(t\)-edge-robust \(r\)-identifying codes in the king lattice
+Normal rank
@@ Property / cites work @@
+Q5437393
@@ Property / cites work: Q5437393 / rank @@
+Normal rank
@@ Property / cites work @@
+Locating sensors in paths and cycles: the case of 2-identifying codes
+Normal rank