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

@@ Property / DOI @@
-.1007/s12095-015-0148-3
@@ Property / DOI: 10.1007/s12095-015-0148-3 / rank @@
-Normal rank
@@ Property / author @@
-Iiro S. Honkala
@@ Property / author: Iiro S. Honkala / rank @@
-Normal rank
@@ Property / author @@
-Antoine C. Lobstein
@@ Property / author: Antoine C. Lobstein / rank @@
-Normal rank
@@ Property / author @@
+Iiro S. Honkala
@@ Property / author: Iiro S. Honkala / rank @@
+Normal rank
@@ Property / author @@
+Antoine C. Lobstein
@@ Property / author: Antoine C. Lobstein / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C69
@@ Property / Mathematics Subject Classification ID: 05C69 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+B25
@@ Property / Mathematics Subject Classification ID: 94B25 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6567143
@@ Property / zbMATH DE Number: 6567143 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+twin-free graphs
@@ Property / zbMATH Keywords: twin-free graphs / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+identifiable graphs
@@ Property / zbMATH Keywords: identifiable graphs / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+identifying codes
@@ Property / zbMATH Keywords: identifying codes / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+Johnson graphs
@@ Property / zbMATH Keywords: Johnson graphs / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+Johnson induced subgraphs
@@ Property / zbMATH Keywords: Johnson induced subgraphs / 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.1007/s12095-015-0148-3
+Normal rank
@@ Property / OpenAlex ID @@
+W1456675268
@@ Property / OpenAlex ID: W1456675268 / rank @@
+Normal rank
@@ 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
@@ Property / DOI @@
+.1007/S12095-015-0148-3
@@ Property / DOI: 10.1007/S12095-015-0148-3 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:267807