广义b-基超立方体网络的符号全控制数  

Signed total domination number for generalizedbase-b hypercube networks

作　　者：梁志鹏 唐芳 杨进霞 LIANG Zhipeng;TANG Fang;YANG Jinxia(College of Information Engineering,Tarim University,843300,Aral,Xinjiang,PRC)

机构地区：[1]塔里木大学信息工程学院,新疆维吾尔自治区阿拉尔市843300

出　　处：《曲阜师范大学学报（自然科学版）》2024年第4期45-48,共4页Journal of Qufu Normal University(Natural Science)

基　　金：塔里木大学校长基金硕士人才项目(TDZKSS202222,TDZKSS202333).

摘　　要：该文研究了广义b-基超立方体网络GC_(n)(b)的符号全控制数γst(GC_(n)(b))的问题.首先给出了当n=2k+1,b=3时,网络GC_(n)(b)的符号全控制数的上下界,然后利用数学归纳递推和反证法,确定了当b=3,n=1,2,3时,网络GC_(n)(b)符号全控制数的精确值.This paper studies how to solve the problem of signed total domination number of generalized base-b hypercube networks.At first,the bounds of the signed total domination number of GC_(n)(b)for n=2k+1,b=3,is studied.Furthermore,the exact values of the signed total domination numbers of generalized base-b hypercube is obtained for b=3,n=1,2,3,by using the mathematical induction recursion and proof by contradiction.

关 键 词：符号全控制函数 符号全控制数 广义b-基超立方体 互连网络 

分 类 号：O157.5[理学—数学]