非连通图C_(2s)∪C_(2t)奇优美标号的计算机算法

The computer algorithm for the odd graceful labeling of unconnected graph C_(2s) ∪ C_(2t)

利用算法设计理论设计了搜索非连通图奇优美标号的算法,并通过算法分析的思想和奇优美图的定义,给出了一类非连通图相应的计算机算法,由此提高了寻找图标号算法的效率。

In light of the theory of algorithm design, we designed an algorithm for the search for the odd graceful labeling of non-connected graph and, with the inspiration of the analysis of this algorithm and the definition of odd graceful graph we proposed a computer algorithm for non-connected graph, which is supposed to result in better efficiency in the search for labeling algorithm.