Efficient dominating sets in Cayley graphs. (Q1406027)
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 1977900
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient dominating sets in Cayley graphs. |
scientific article; zbMATH DE number 1977900 |
Statements
Efficient dominating sets in Cayley graphs. (English)
0 references
9 September 2003
0 references
An independent set \(C\) of vertices in a graph is called an efficient dominating set if each vertex not in \(C\) is adjacent to exactly one vertex in \(C\). Efficient dominating sets are also called perfect codes. An \(E\)-chain is a countable family of nested graphs, each of which has an efficient dominating set. The authors give a constructing tool to produce \(E\)-chains of Cayley graphs. Using this tool infinite families of \(E\)-chains of Cayley graphs on symmetric groups are constructed.
0 references
perfect code
0 references
Hamming code
0 references
star graph
0 references
pancake graph
0 references
0.8720903396606445
0 references
0.850997269153595
0 references
0.8403539061546326
0 references
0.8384655117988586
0 references
0.8378863334655762
0 references
