两类图的逆符号边控制数  

Inverse signed edge domination number of two classes graphs

作　　者：席梦雨 红霞[1] Xi Mengyu;Hong Xia(Department of Mathematics,Luoyang Normal University,Luoyang 471022,China)

机构地区：[1]洛阳师范学院数学科学学院,河南洛阳471022

出　　处：《纯粹数学与应用数学》2020年第3期357-367,共11页Pure and Applied Mathematics

基　　金：国家自然科学基金(11701257);河南省教育厅高校重点项目(18A110025).

摘　　要：利用穷标法及分类讨论法得到了两类图W^*n+1和F^*n+1的逆符号边控制数的精确值.这里图W^*n+1表示轮图Cn∨K1的圈Cn的每个顶点上增加一条悬挂边而得到的图,图F^*n+1表示扇图Pn∨K1的路Pn的每个顶点上增加一条悬挂边而得到的图.In this paper, we are give a exact value of inverse signed edge domination number of two classes graphs Wn+1* and Fn+1* by exhaustived method and classified discussion. Where Wn+1* denotes is a graph obtained by every vertex of Cn of wheel graph Cn∨K1 identified one pendant edge, Fn+1* denotes is a graph obtained by every vertex of Pn of Fan graph Pn∨K1 identified one pendant edge.

关 键 词：逆符号边控制函数 逆符号边控制数 图W^*n+1 图F^*n+1 

分 类 号：O178[理学—数学]