计算图p(n,k)罗马支配数的算法，计算罗马支配数是一个np—complete问题，这里给出一个相对高性能的算法。-calculated plan p (n, k) Rome disclaimer few algorithm disclaimer calculated Rome is a few np-complete problem here is a relatively high-performance algorithm.

罗马支配数的算法，对广义Petersen图P(n,2)的罗马支配数进行了研究-Rome dominated the number of algorithms, on the generalized Petersen graph P (n, 2) the number of Roman domination of the research