引用本文:
【打印本页】   【下载PDF全文】   查看/发表评论  【EndNote】   【RefMan】   【BibTex】
←前一篇|后一篇→ 过刊浏览    高级检索
本文已被:浏览 1661次   下载 1986 本文二维码信息
码上扫一扫!
分享到: 微信 更多
图的符号团边控制数
敖国艳1,2,3, 吉日木图2,3, 赵凌琪2
1.呼伦贝尔学院数学科学学院, 内蒙古 海拉尔 021008;2.内蒙古民族大学离散数学研究所, 内蒙古 通辽 028043;3.内蒙古民族大学数学学院, 内蒙古 通辽 028043
摘要:
本文研究了图的符号团边控制数的问题.利用鸽巢原理,获得了图KnPmKnCm的符号团边控制数,推广了已有的结果.
关键词:    符号团边控制数  符号团边控制函数
DOI:
分类号:O157.5;O157.6
基金项目:Supported by National Natural Science Foundation of China (61262018);Natural Science Foundation of Inner Mongolia of China (2014MS0116)
SIGNED CLIQUE EDGE DOMINATION NUMBERS OF GRAPHS
AO Guo-yan1,2,3, Jirimutu2,3, ZHAO Ling-qi2
1.School of Mathematical Sciences, Hulunbuir College, Hailaer 021008, China;2.Institute of Discrete Mathematics, Inner Mongolia University for Nationalities,Tongliao 028043, China;3.College of Mathematics, Inner Mongolia University for Nationalities, Tongliao 028043, China
Abstract:
In this paper, we study signed clique edge domination number of graph. By using pigeonhole principle, we obtain the signed clique edge domination numbers of graphs KnPm and KnCm, which extend the known results.
Key words:  graphs  signed clique edge domination number  signed clique edge dominating function