| 摘要: |
| 本文研究了图G的符号全控制数γst（G）的问题.利用穷标法及分类讨论法，主要得到了两类图n·Fm+1和n·Wm+1的符号全控制数的精确值，从而改正了已知结果，这里图n·Fm+1和n·Wm+1分别表示把n个扇图的中心点和n个轮图的中心点粘接而得到的图. |
| 关键词: 符号全控制函数 符号全控制数 图n·Fm+1 图n·Wm+1 |
| DOI： |
| 分类号:O157.5 |
| 基金项目:国家自然科学基金资助（11701257；11801253）；河南省教育厅高校重点项目资助（18A110025；18A110026）；河南省科技计划项目资助（182102310930；182102310955）；（2017-JSJYYB-074）；（2017XJJG054）. |
|
| SIGNED TOTAL DOMINATION NUMBER OF TWO CLASSES GRAPHS |
|
MA Meng-han, HONG Xia
|
|
School of Mathematical Sciences, Luoyang Normal University, Luoyang 471022, China
|
| Abstract: |
| In this paper, we study the signed total domination number γst(G) of graphs G. We obtain exact values of the signed total domination number of two classes graph n·Fm+1 and n·Wm+1 by exhaustived method and classified discussion, which is corrected the known results, where n·Fm+1 and n·Wm+1 are denote a graph obtained by identifying the center vertex of n Fan graphs Fm+1 and identifying the center vertex of n Wheel graphs Wm+1, respectively. |
| Key words: signed total domination function signed total domination number graph n·Fm+1 graph n·Wm+1 |
