On the number of optimal identifying codes in a twin-free graph (Q476309)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On the number of optimal identifying codes in a twin-free graph |
scientific article; zbMATH DE number 6375312
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the number of optimal identifying codes in a twin-free graph |
scientific article; zbMATH DE number 6375312 |
Statements
On the number of optimal identifying codes in a twin-free graph (English)
0 references
28 November 2014
0 references
twin-free graphs
0 references
identifiable graphs
0 references
identifying codes
0 references
0 references
