一些特定图类的严格强控制数  

Strict Majority Domination Number of Some Certain Families of Graphs

作　　者：任庆军[1] 

机构地区：[1]临沂师范学院数学系,山东临沂276005

出　　处：《淮阴师范学院学报（自然科学版）》2002年第3期10-12,共3页Journal of Huaiyin Teachers College;Natural Science Edition

基　　金：山东省教育厅自然科学基金资助项目(J0 1P5 1)

摘　　要：设图G=(V,E),对于函数f:V→ ｛- 1,1 ｝,记f的权重f(V) =∑v∈Vf(v),对v∈V,记f[v]=∑u∈N[v]f(u).图G的严格强控制函数是f:V→｛- 1,1 ｝使得对V中多于一半的顶点v有f[v]≥1,图G的严格强控制数是G的所有严格强控制函数的量小权重,且用smaj(G)表示.Let G=(V,E) be a graph.For a function f:V→{-1,1}, the weight of f is f(V)=∑v∈Vf(v) .For a vertex v in V ,we define f=∑u∈Nf(u) .A strict majority dominating function of G is a function f:V→{-1,1} ,such that f≥1 for more than half of the vertices in V .The strict majority dmination number is the minimum possible weight of all strict mojority dominating function,and is denoted as smaj (G) .We determine the strict majority domination numbers of some certain families of graphs.

关 键 词：图 函数 严格强控制 

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