| C_n~2图的符号控制数 |
| |
| 引用本文： | 丁丹军.C_n~2图的符号控制数[J].宜春学院学报,2012,34(8):21-23. |
| |
| 作者姓名： | 丁丹军 |
| |
| 作者单位： | 连云港师范高等专科学校数学与应用数学系,江苏连云港,222006 |
| |
| 基金项目： | 2012年度校级基础研究和应用对策研究立项课题 |
| |
| 摘 要： | 设图G=G(V,E),令函数f:V→{-1,1},f的权w(f)=∑v∈Vfv],对v∈V,定义fv]=∑u∈Nv]f(u),这里Nv]表示V中顶点v及其邻点的集合。图G的符号控制函数为f:V→{-1,1}满足对所有的v∈V有fv]≥1,图G的符号控制数γs(G)就是图G上符号控制数的最小权,称其f为图G的γs-函数。研究了C2n图,通过给出它的一个γs-函数得到了其符号控制数。
|
| 关 键 词： | 图 圈 符号控制数 符号控制函数 |
The Signed Domination Number of C2n Graph |
| |
| DING Dan-jun.The Signed Domination Number of C2n Graph[J].Journal of Yichun University,2012,34(8):21-23. |
| |
| Authors: | DING Dan-jun |
| |
| Institution: | DING Dan-jun(Department of Mathematics and Applied Mathematics Lanyungang Teacher’s College,Lianyungang 222006,China) |
| |
| Abstract: | Let G=G(V,E) be a graph.For a function f:V→{-1,1},the weight of f is w(f) = ∑v∈Vfv].For a vertex v∈V,we define fv] = ∑u∈Nv]f(u),where Nv] denotes the set of v and the adjacent vertices of v in V.A signed dominating function of G is a function f:V→{-1,1},such thatfv]≥1 for all v∈V.The signed domination number γs(G) of G is the minimum weight of a signed dominating function on G.The signed dominating function of a weight γs(G) we call γs(G)-function of G.In this paper we study the C2n graph,and γs(C2n)-function of C2n and the signed domination number γs(C2n) of C2n is obtained. |
| |
| Keywords: | Graph the Signed Domination Number The Signed Domination Function AMS(2002) Classfication :05C69 |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
