| 两类图的符号控制数 |
| |
| 引用本文： | 任媛,赵凌琪,吉日木图,王妍.两类图的符号控制数[J].纯粹数学与应用数学,2014(3):271-279. |
| |
| 作者姓名： | 任媛 赵凌琪 吉日木图 王妍 |
| |
| 作者单位： | [1]内蒙古民族大学数学学院,内蒙古通辽市028043 [2]内蒙古民族大学计算机科学与技术学院,内蒙古通辽市028043 [3]山东水利职业学院信息工程系,山东日照276826 |
| |
| 基金项目： | 国家自然科学基金（61261025,61262018）; 内蒙古民族大学校级研究项目（NMD1104） |
| |
| 摘 要： | 图G的符号控制数γs(G)有着许多重要的应用背景,因而确定其精确值有重要意义.Cm表示m个顶点的圈,n-Cm和n·Cm分别表示恰有一条公共边或一个公共顶点的n个Cm的拷贝.给出了n-Cm和n·Cm的符号控制数.
|
| 关 键 词： | 图 符号控制函数 符号控制数 |
Signed domination numbers for two class of graphs |
| |
| Ren Yuan,Zhao Lingqi,Jirimutu,Wang Yan.Signed domination numbers for two class of graphs[J].Pure and Applied Mathematics,2014(3):271-279. |
| |
| Authors: | Ren Yuan Zhao Lingqi Jirimutu Wang Yan |
| |
| Institution: | 1. College of Mathematics, Inner Mongolia University for Nationalities, Tongliao 028043, China; 2. College of Computer and Technology, Inner Mongolia University for Nationalities, Tongliao 028043, China; 3. Department of Information Engineering, Shandong Water Polytechnic, Rizhao 276826, China) |
| |
| Abstract: | The signed domination number of a graph has its import and applying background, so it is useful to determinate the exact value of it. Cm denotes the cycle of length m, n- Cmand n · Cmdenote the graph obtained from any n copies of Cm which have just one common edge and one common vertex, respectively. In this paper, we obtain the signed domination numbers of n- Cmand n·Cm. |
| |
| Keywords: | graph signed domination function signed domination number |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
