由Km×P(n m=1,2,3,4)的cordial性,给出了Km×P2n的Cordial标号,证明了这一类图是Cordial图。
By introducing the cordiality of Km×P(n m=1,2,3,4),this paper uses the cordial label of Km×P2n to prove that these graphs are cordial graphs
任俊峰,宋晓刚. Km×P2n的Cordial性[J].西昌学院学报(自然科学版),2012,(1):55-56,62.