Total domination and least domination in a tree
Discrete Mathematics（2003）
摘要
The total domination number γt of a graph G = (V,E) is the minimum cardinality of a dominating set D of G such that every vertex of V has at least one neighbor in D. The least domination number γL of G is the minimum cardinality of a dominating set X of G whose domination number is the minimum. In this paper, we prove the following conjecture due to Odile Favaron: Conjecture. For any tree T, we have γL(T)/γt(T) ≤ 3/2.
更多查看译文
关键词
total domination number,odile favaron,domination number,dominating set x,least dominating set,following conjecture,graph g,middle vertex,total dominating set,minimum cardinality,dominating set
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要