On graphs on \(n\) vertices having an identifying code of cardinality \(\lceil \log_{2}(n+1)\rceil\) (Q2506367)
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 graphs on n vertices having an identifying code of cardinality _2(n+1) |
scientific article; zbMATH DE number 5058319
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On graphs on \(n\) vertices having an identifying code of cardinality \(\lceil \log_{2}(n+1)\rceil\) |
scientific article; zbMATH DE number 5058319 |
Statements
On graphs on \(n\) vertices having an identifying code of cardinality \(\lceil \log_{2}(n+1)\rceil\) (English)
0 references
28 September 2006
0 references
identifying codes
0 references
fault detection
0 references
graph theory
0 references
0 references
0.8943212
0 references
0.89416885
0 references
0.87762904
0 references
0.8774113
0 references
0.8735783
0 references
0.8728348
0 references
0 references
0.8634349
0 references
