The anti-Kekule number is the smallest number of edges that must be removed from a connected graph with a perfect matching so that the graph remains connected, but has no perfect matchings. The calculation of this invariant is demonstrated on ladders, cyclic ladders and Mobius ladders in this paper by analyzing the structures of their graphs, and it is shown that the anti-Kekule numbers of these models are 3 or 4.