摘要
设图G=(V,E)为一个简单图,且δ(G)≥1,令f:V■{-2,-1,1,2}是图G上的一个函数,如果对任意的顶点v∈V,均有f(N(v))≥1成立,则称f为图G的一个2符号全控制函数.主要用分类讨论方法和穷标法得到路P_m和圈C_m的2符号全控制数的精确值.
Let G=(V,E)be a graph andδ(G)≥1.A function f:V■{-2,-1,1,2}is said to be a 2-signed total domination function if f(N(v))≥1 for v∈V.In this paper,the exact values of the 2-signed total domination number of path P_m and cycle C_m are determined by exhaustived method and classified discussion.
引文
[1]Bondy J A,Murty U S R.Graph theory with applications[M].London:Macmillan Press,1976.
[2]Dunbar J E,Hedetniemi S T,Henning M A,et al.Signed domination in graphs[M].New Jersey:John Wiley Inc,1995:311.
[3]徐保根.图的控制与染色理论[M].武汉:华中科技大学出版社,2013.
[4]Henning M A.Signed total domination in graphs[J].Discrete Math,2004,278(7):109.
[5]Zelinka B.Signed total domination number of a graph[J].Czechoslovak Math J,2001,51(2):225.
[6]Xu Baogen.On signed cycle domination numbers in graphs[J].Discrete Math,2009,309(4):1007.
[7]Asgharsharghi L,Sheikholeslami S M.Signed total Roman edge domination in graphs[J].Discuss Math Graph Theory,2017,37(4):1039.
[8]尚华辉,苗连英.关于图的两类符号控制数的下界[J].数学的实践与认识,2017,47(21):223.
[9]闫云娟,徐保根,冯大一.两类图的符号控制数[J].华东交通大学学报,2017,34(6):109.
[10]李文升,黄中升,冯志芳,等.图的2符号全控制数[J].江苏师范大学学报(自然科学版),2017,35(2):31.