An algorithm for computing the connected components of the cycle graph of the given two signed genomes is studied, which is more efficient than the primary algorithm.
从边集合出发给出了计算有向基因组的圈图连通分支的线性时间算法。
With the definition of the strong signed domination function and the strong signed domination number of a graph, some lower bounds of the strong signed domination number about graph are obtained.
本文对几类特殊图的强符号控制函数及强符号控制数进行了研究，给出了完全图、完全二部图、路及圈的强符号控制数。
With the definition of the strong signed domination function and the strong signed domination number of a graph, some lower bounds of the strong signed domination number about graph are obtained.
本文对几类特殊图的强符号控制函数及强符号控制数进行了研究，给出了完全图、完全二部图、路及圈的强符号控制数。
应用推荐