Constructive characterizations of （γp, γ）- and （γp, γpr）-trees

• 作 者: CHEN Lei LU Chang-hong ZENG Zh
• 机 构: ShanghaiKeyLaboratoryofTrustworthyComputing,DepartmentofMathematics
• 出 处: 高校应用数学学报：英文版
• 发表日期: 2008年4期
• 关键词: 功率控制 偶控制 树 控制集 domination power domination paired-domination tree
• 基金项目: Supported in part by National Natural Science Foundation of China （60673048, 10471044）, National Basic Research Program （2003CB318003）, Shanghai Leading Academic Discipline Project （B407）

Let G =(V,E) be a graph without isolated vertices.A set S  V is a domination set of G if every vertex in V -S is adjacent to a vertex in S,that is N[S] = V .The domination number of G,denoted by γ(G),is the minimum cardinality of a domination set of G.A