Efficient dominating sets in Cayley graphs. (Q1406027): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A group-theoretic model for symmetric interconnection networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4388201 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3941433 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Perfect codes in graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4368728 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Perfect codes over graphs / rank | |||
Normal rank | |||
Latest revision as of 10:50, 6 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient dominating sets in Cayley graphs. |
scientific article |
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
