Minimum sizes of identifying codes in graphs differing by one edge (Q2016394)
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 edge |
scientific article; zbMATH DE number 6305765
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimum sizes of identifying codes in graphs differing by one edge |
scientific article; zbMATH DE number 6305765 |
Statements
Minimum sizes of identifying codes in graphs differing by one edge (English)
0 references
20 June 2014
0 references
graph theory
0 references
twin-free graphs
0 references
identifiable graphs
0 references
identifying codes
0 references
0.9730625152587892
0 references
0.8698741793632507
0 references
0.8611269593238831
0 references
0.8354805707931519
0 references
0.8284737467765808
0 references
