Minimum sizes of identifying codes in graphs differing by one vertex (Q2392684)
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: Minimum sizes of identifying codes in graphs differing by one vertex |
scientific article; zbMATH DE number 6194317
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum sizes of identifying codes in graphs differing by one vertex |
scientific article; zbMATH DE number 6194317 |
Statements
Minimum sizes of identifying codes in graphs differing by one vertex (English)
0 references
2 August 2013
0 references
graph theory
0 references
twin-free graphs
0 references
identifiable graphs
0 references
identifying codes
0 references
0.9730625152587892
0 references
0.8850902915000916
0 references
0.880663275718689
0 references
0.8530424237251282
0 references
0.846673846244812
0 references
