On Minus Paired-Domination in Graphs  

作　　者：邢化明 孙良 

机构地区：[1]Department of Mathematics, School of Science

出　　处：《Journal of Beijing Institute of Technology》2003年第2期202-204,共3页北京理工大学学报（英文版）

基　　金：SponsoredbytheNationalNaturalScienceFoundation (198710 3 6)

摘　　要：The study of minus paired domination of a graph G=(V,E) is initiated. Let SV be any paired dominating set of G , a minus paired dominating function is a function of the form f∶V→{-1,0,1} such that f(v)= 1 for v∈S, f(v)≤0 for v∈V-S , and f(N)≥1 for all v∈V . The weight of a minus paired dominating function f is w(f)=∑f(v) , over all vertices v∈V . The minus paired domination number of a graph G is γ - p( G )=min{ w(f)|f is a minus paired dominating function of G }. On the basis of the minus paired domination number of a graph G defined, some of its properties are discussed.The study of minus paired domination of a graph G=(V,E) is initiated. Let SV be any paired dominating set of G , a minus paired dominating function is a function of the form f∶V→{-1,0,1} such that f(v)= 1 for v∈S, f(v)≤0 for v∈V-S , and f(N)≥1 for all v∈V . The weight of a minus paired dominating function f is w(f)=∑f(v) , over all vertices v∈V . The minus paired domination number of a graph G is γ - p( G )=min{ w(f)|f is a minus paired dominating function of G }. On the basis of the minus paired domination number of a graph G defined, some of its properties are discussed.

关 键 词：paired  dominating function minus paired  dominating function minus paired  domination number 

分 类 号：O157.5[理学—数学]