On the Structure of Identifiable Graphs (Q3439386): Difference between revisions

@@ Property / DOI @@
-.1016/j.endm.2005.06.094
@@ Property / DOI: 10.1016/j.endm.2005.06.094 / rank @@
-Normal rank
@@ Property / author @@
-Antoine C. Lobstein
@@ Property / author: Antoine C. Lobstein / rank @@
-Normal rank
@@ Property / author @@
+Antoine C. Lobstein
@@ Property / author: Antoine C. Lobstein / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.endm.2005.06.094
+Normal rank
@@ Property / OpenAlex ID @@
+W2071845028
@@ Property / OpenAlex ID: W2071845028 / rank @@
+Normal rank
@@ Property / cites work @@
+Identifying codes with small radius in some infinite regular graphs
+Normal rank
@@ Property / cites work @@
+Extremal cardinalities for identifying and locating-dominating codes in graphs
+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.ENDM.2005.06.094
@@ Property / DOI: 10.1016/J.ENDM.2005.06.094 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3439386