On identifying codes in the Cartesian product of a path and a complete graph (Q281771)
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 identifying codes in the Cartesian product of a path and a complete graph |
scientific article; zbMATH DE number 6579234
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On identifying codes in the Cartesian product of a path and a complete graph |
scientific article; zbMATH DE number 6579234 |
Statements
On identifying codes in the Cartesian product of a path and a complete graph (English)
0 references
11 May 2016
0 references
identifying code
0 references
graph products
0 references
complete graph
0 references
path
0 references
0.8378943800926208
0 references
0.8344728946685791
0 references
0.8324946761131287
0 references
0.8208260536193848
0 references
0.817338764667511
0 references
