Total domination excellent trees (Q1869221)
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 1896005
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Total domination excellent trees |
scientific article; zbMATH DE number 1896005 |
Statements
Total domination excellent trees (English)
0 references
9 April 2003
0 references
A set \(S\) of vertices of a graph \(G\) is a total dominating set if every vertex of \(G\) is adjacent to some vertex of \(S\) (other than itself). A graph is total domination excellent, denoted by \(\gamma_t\)-excellent, if every vertex belongs to some total dominating set of smallest cardinality. The author shows that the class of \(\gamma_t\)-excellent trees can be constructed recursively by starting with a star and repeatedly applying one of four operations.
0 references
total domination
0 references
tree
0 references
0.9321631193161012
0 references
0.8506212830543518
0 references
0.8434998989105225
0 references
0.8361678719520569
0 references
0.8200990557670593
0 references
