河南科技大学学报（自然科学版）2012，Vol.33Issue(4)：74-77,4.
关于图的符号边控制数的一些结论
Some Conclusion of Signed Edge Domination Numbers in Graphs
摘要
Abstract
Let G = ( V, E) be a graph, a function f: E→{ - 1,1}I is said to be a signed edge dominating function (SEDF) of G if Σe'∈N(E) f(e')≥1 holds for every edge e ∈ E( G) . The signed edge domination number r',( G) of G is defined as r.', ( G) = min { Σe'∈N(E) f(e')}of is an SEDF of G} . This paper mainly studied the signed edge dominating fuction. A new lower bounds of the signed edge domination number is obtained,and the signed domination numbers of the P2 X Cn is determined.关键词
符号边控制函数/符号边控制数/乘积图Key words
Signed edge dominating fuction/Signed edge domination number/Product of graphs分类
数理科学引用本文复制引用
徐保根,张亚琼,汤友良..关于图的符号边控制数的一些结论[J].河南科技大学学报（自然科学版）,2012,33(4):74-77,4.基金项目
国家自然科学基金项目(11061014) （11061014）
江西省教育厅科研基金项目(GJJ09235) （GJJ09235）
