关于模和图问题的几个新结果

Some new results on mod sum graph

模和图是和图的一种推广。采用一般标号法,分别给出由n个C4、C5、C6构成的多重复合圈图<C4;n>、<C5;n>、<C6;n>的模和标号,从而证明其为模和图;然后,证明由m条长度为n的道路构成的并图mPn也是模和图;最后给出了二部图K2,n的另一种模和图标号。

Mod sum graph is the promotion of sum graph. The paper attempts to prove that 〈 C4 ;n 〉, 〈 Cs ; n 〉 , 〈 C6 ; n 〉 are mod sum graphs using the general graph labeling, It is proved that the union graph mPn is rood sum graph; The paper ends with another rood sum labeling of bipartite graph K2, n.