Upper total domination in claw-free grap
โ
Odile Favaron; Michael A. Henning
๐
Article
๐
2003
๐
John Wiley and Sons
๐
English
โ 114 KB
## Abstract A set __S__ of vertices in a graph __G__ is a total dominating set of __G__ if every vertex of __G__ is adjacent to some vertex in __S__ (other than itself). The maximum cardinality of a minimal total dominating set of __G__ is the upper total domination number of __G__, denoted by ฮ~__