Strong identification codes for graphs (Q2037550): Difference between revisions

@@ Property / DOI @@
-.1016/j.disc.2021.112475
@@ Property / DOI: 10.1016/j.disc.2021.112475 / rank @@
-Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W3170943312
@@ Property / OpenAlex ID: W3170943312 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.06733
@@ Property / arXiv ID: 2108.06733 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3503433
@@ Property / cites work: Q3503433 / rank @@
+Normal rank
@@ Property / cites work @@
+Paths in graphs
@@ Property / cites work: Paths in graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Characterizing identifying codes from the spectrum of a graph or digraph
+Normal rank
@@ Property / cites work @@
+On the size of identifying codes in triangle-free graphs
+Normal rank
@@ Property / cites work @@
+Bounds for identifying codes in terms of degree parameters
+Normal rank
@@ Property / cites work @@
+On graphs having a \(V\setminus \{x\}\) set as an identifying code
+Normal rank
@@ Property / cites work @@
+On a new class of codes for identifying vertices in graphs
+Normal rank
@@ Property / DOI @@
+.1016/J.DISC.2021.112475
@@ Property / DOI: 10.1016/J.DISC.2021.112475 / rank @@
+Normal rank