摘要
本文研究了图的强符号圈控制数γ′_(ssc)(G).利用最大独立集最大匹配等方法,刻画了满足γ′_(ssc)(G)=|E|-2的所有连通图,给出了γ′_(ssc)(G)的一个下界,求出了两类特殊图的强符号圈控制数.
In this paper,we study the strong signed cycle domination number γ′_(ssc)(G)of graph G By using maximum independent set,maximum matching etc.,we characterize all connected graphs G with γ′_(ssc)(G)=|E(G)|-2,and obtain a lower bound on γ′_(ssc)(G).Finally we give the exact value of γ′_(ssc)(G) for two special classes of graphs.
引文
[1]Bondy J A,Murty U S R.Graph theory with applications[M].New York:Macmillan,1976.
[2]Xu Baogen.On signed cycle domination in graphs[J].Discrete Math.,2009,309:1007-1012.
[3]吕新忠.图的全符号控制数[J].中国科学,2007,37(5):573-578.
[4]黄中升,邢化明,赵燕冰.图的逆符号边控制数的上界[J].应用数学学报,2010,33(5):840-846.
[5]徐保根,张亚琼,罗茜,丁宗鹏.图的反符号全控制数[J].华东交通大学学报,2012,29(1):35-38.
[6]Sheikholeslami S M,Volkmann L.Signed total k-domination and k-domatic numbers of graphs[J].Discrete Math.,Algorithms and Appl.,2012,4(1):1-11.