节点文献
图的最小符号控制函数的充要条件
The Necessary and Sufficient Condition of a Minimum Signed Dominating Function inGraphs
【摘要】 在图G=(V,E)的顶点集V上定义一个二值函数产f=V→{一1,1},使对任何.v∈V,f(N[v]≥1,则称f是图G的一个符号控制函数.图的符号控制函数的权重定义为f(V)=∑v∈Vf(V),它的最小权重称为图的符号控制数,记为r_x(G)达到最小权重的符号控制函数称为图的最小符号控制函数,本文讨论最小符号控制函数的必要条件.
【Abstract】 A two-valued fuction f defined on the vertices of a graph G=(V,E),f: -{-1,1},is a signed dominating function,such that for every v∈V,f(N[v])≥1. The weight of a signed dominating function is f(v)=∑v∈vf(v). The minimum weight of a signed dominating function of G is signed domin ation number of a graph G,denoted ,γ(G). A signed dominating function, its weight equals signed doninimation number, is known as minimum signed dominating function. In this peper,we discuss a necessary and sufficient condition of a minimum signed dominating function.
【关键词】 图;
符号控制函数;
最小符号控制函数;
【Key words】 graph; signed dominating function; minimum signed dominating function;
【Key words】 graph; signed dominating function; minimum signed dominating function;
【基金】 江西省自然科学基金
- 【文献出处】 阴山学刊 ,Yin Shan Academic Journal , 编辑部邮箱 ,1999年05期
- 【分类号】O157.5
- 【被引频次】6
- 【下载频次】25