On the ensemble of optimal identifying codes in a twin-free graph (Q267807)
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 ensemble of optimal identifying codes in a twin-free graph |
scientific article; zbMATH DE number 6567143
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the ensemble of optimal identifying codes in a twin-free graph |
scientific article; zbMATH DE number 6567143 |
Statements
On the ensemble of optimal identifying codes in a twin-free graph (English)
0 references
11 April 2016
0 references
twin-free graphs
0 references
identifiable graphs
0 references
identifying codes
0 references
Johnson graphs
0 references
Johnson induced subgraphs
0 references
0 references
0.9384257793426514
0 references
0.846673846244812
0 references
0.834553599357605
0 references
0.8284737467765808
0 references
