Efficient \(k\)-distance dominating set in Cayley graphs (Q2212689)
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 7277550
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient \(k\)-distance dominating set in Cayley graphs |
scientific article; zbMATH DE number 7277550 |
Statements
Efficient \(k\)-distance dominating set in Cayley graphs (English)
0 references
24 November 2020
0 references
distance domination
0 references
efficient distance domination
0 references
Cayley/circulant graph
0 references
0.8369630575180054
0 references
0.8330715894699097
0 references
0.8299724459648132
0 references
0.8281314373016357
0 references
0.8277596235275269
0 references
