图的临界群是图的生成树数目的一个加细.它是图的一个精细不变量.确定Pn×C4的临界群的结构.证明了Pn×C4的临界群的Smith标准形总是两个或三个循环群的直和.
invariant of the it is shown that The critical group of a graph is a refinement of the number of spanning trees of the graph. It is a subtle isomorphism graph. In this paper, the structure of the critical group of the Cartesian products graph Pn × C4 is determined and the critical group of Pn × C4 is direct sum of two or three cyclic groups.