The n-ladder graph can be defined as L_n = P_2 square P_n, where P_n is a path graph (Hosoya and Harary 1993; Noy and Ribó 2004, Fig. 1). It is therefore equivalent to the 2×n grid graph. The ladder graph is named for its resemblance to a ladder consisting of two rails and n rungs between them (though starting immediately at the bottom and finishing at the top with no offset). Hosoya and Harary also use the term "ladder graph" for the graph Cartesian product K_2 square C_n, where K_2 is the complete graph on two nodes and C_n is the cycle graph on n nodes. This class of graph is however more commonly known as a prism graph.

cocktail party graph | crossed prism graph | cycle graph | cyclotomic graph | gear graph | grid graph | Hadamard graph | helm graph | ladder rung graph | Möbius ladder | path graph | prism graph | web graph | wheel graph