内蒙古民族大学学报：自然科学版2012，Vol.27Issue(4)：404-405,2.
两类图的符号边控制数
Signed Edge Domination Numbers of Two Classes of Graphs
摘要
Abstract
For any positive integers m and n,let I(Cm)denotes the graph which is obtained by adding one pendent edges to every vertex of circle Cm whose length is m,and let I(d(v)-1)(Kn) denotes the graph which is obtained by adding(d(v)-1) pendent edges to every vertex v of complete graph Kn.In this paper,γ's(I(Cm))=0 and γ's(I(d(v)-1)(Kn))= 1/2(3n-n2) are designed.关键词
两类图/符号边控制函数/符号边控制数Key words
Two class of graphs/Signed edge domination function/Signed edge domination numbers分类
数理科学引用本文复制引用
红霞,冯伟..两类图的符号边控制数[J].内蒙古民族大学学报：自然科学版,2012,27(4):404-405,2.基金项目
内蒙古自治区高等学校科学研究项目 （）
内蒙古民族大学科研项目 （）
