Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets (Q2376092)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6181326
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets |
scientific article; zbMATH DE number 6181326 |
Statements
Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets (English)
0 references
26 June 2013
0 references
identifying codes
0 references
dominating sets
0 references
digraphs
0 references
infinite digraphs
0 references
induced sets
0 references
0.8388323783874512
0 references
0.8069196939468384
0 references
0.8027419447898865
0 references
0.7829875946044922
0 references
0.7694410085678101
0 references
