关于图的反符号圈控制数

摘要

In this paper, the author studies the reverse signed cycle domination of graphs. By using partition method and reduction to absurdity, the author characterizes those graphs with m edges and reverse signed cycle domination number - m + 4 and determines reverse signed cycle domination numbers of complete bipartite graphs.%本文研究了图的反符号圈控制的问题.利用分类和反证的方法,获得了满足反符号圈控制数为负边数加4的连通图的刻画和完全二部分图的反符号圈控制数.