几种特殊图之间和的Cordial性

On the Cordiality of the Join of Some Special Graphs

给出了路Pm、圈Cn、扇Fp和轮Wq4种图之间和的Cordial性,所得结果扩展了文献[1](Gallian J A.ADynamic Survey of Graph Labellings of Graphs.Electronic Journal of Combinatorics,2005(5):DS6)的研究工作.

The cordiality of the join of path, cycle, fan and wheel are investigated. The results extend the work of the reference [1] （Gallian J A. A Dynamic Survey of Graph Labellings of Graphs. Electronic Journal of Combinatorics, 2005 （5） ： DS6）.