华东交通大学学报2017，Vol.34Issue(6)：109-115,7.
两类图的符号控制数
On Signed Domination Numbers for Two Classes of Graphs
摘要
Abstract
Let G=(V,E) be a graph, a function f:V→{1,-1} is said to be a signed dominating function (SDF); when S(∪)V, there is the following f(S)=v∈SΣf(v). If f(N[v])≥1 holds for all v∈V, the signed domination number is γs(G)=min {f (V)|f is an SDF of G}. In this paper, the signed domination problem for two classes of special graphs is re-searched and the signed domination numbers of C(n,m)=Cn Pm and C(n,m,n)=Cn Pm Cn are obtained.关键词
图/符号控制函数/符号控制数Key words
graph/signed dominating function/signed domination number分类
数理科学引用本文复制引用
闫云娟,徐保根,冯大一..两类图的符号控制数[J].华东交通大学学报,2017,34(6):109-115,7.基金项目
国家自然科学基金( 11361024 ) （ 11361024 ）
江西省高校科技落地计划项目( KJLD12067 ) （ KJLD12067 ）
江西省自然科学基金项目(20171BAB201009) （20171BAB201009）
