偶图的符号控制数的两个下界

Two Lower Bounds about the Signed Dominatin Number in Bipartite Graphs

对于偶图G的符号控制数γs,毛经中等证明了γs≥ 4 (1+n - 1) -n ,对此结果作进一步的改进 .

Let γ s be the signed domination number of a graph G .C. Wang and J, Mao had proved that the inequality γ s≥4(1+n-1)-n h olds for all the bipartite graphs of order n. In this paper, we will give an imp rovement of this result and get a new one.