On graphs on \(n\) vertices having an identifying code of cardinality \(\lceil \log_{2}(n+1)\rceil\) (Q2506367): 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.1016/j.dam.2006.03.011
+Normal rank
@@ Property / OpenAlex ID @@
+W2002611253
@@ Property / OpenAlex ID: W2002611253 / rank @@
+Normal rank
@@ Property / cites work @@
+Extremal cardinalities for identifying and locating-dominating codes in graphs
+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 @@
+Construction of codes identifying sets of vertices
+Normal rank
@@ Property / cites work @@
+On a new class of codes for identifying vertices in graphs
+Normal rank
@@ Property / cites work @@
+Identifying Codes and Covering Problems
@@ Property / cites work: Identifying Codes and Covering Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q4474243
@@ Property / cites work: Q4474243 / rank @@
+Normal rank