Perfect codes in circulant graphs (Q526235)
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 6713453
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Perfect codes in circulant graphs |
scientific article; zbMATH DE number 6713453 |
Statements
Perfect codes in circulant graphs (English)
0 references
10 May 2017
0 references
perfect code
0 references
total perfect code
0 references
efficient dominating set
0 references
efficient open dominating set
0 references
Cayley graph
0 references
circulant graph
0 references
0.8406166434288025
0 references
0.8348839282989502
0 references
0.8338602781295776
0 references
0.8327372074127197
0 references
0.8278461694717407
0 references
