Identifying codes in the direct product of a complete graph and some special graphs (Q1720324)
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: Identifying codes in the direct product of a complete graph and some special graphs |
scientific article; zbMATH DE number 7018425
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Identifying codes in the direct product of a complete graph and some special graphs |
scientific article; zbMATH DE number 7018425 |
Statements
Identifying codes in the direct product of a complete graph and some special graphs (English)
0 references
8 February 2019
0 references
identifying code
0 references
direct product
0 references
complete graph
0 references
cycle
0 references
bipartite graph
0 references
0.9026331901550292
0 references
0.8607335090637207
0 references
0.8551337122917175
0 references
0.8427940011024475
0 references
0.8404586911201477
0 references
