On minimum identifying codes in some Cartesian product graphs (Q2409538)
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 6789918
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On minimum identifying codes in some Cartesian product graphs |
scientific article; zbMATH DE number 6789918 |
Statements
On minimum identifying codes in some Cartesian product graphs (English)
0 references
11 October 2017
0 references
identifying code
0 references
dominating set
0 references
Cartesian product
0 references
prism
0 references
grid graphs
0 references
0.8804842829704285
0 references
0.8548692464828491
0 references
0.8409900069236755
0 references
0.8372145891189575
0 references
0.8266175389289856
0 references
