 Sometimes the term "ladder graph" is used for the "n" × "P"2 ladder rung graph, which is the graph union of "n" copies of the path graph P2.The circular ladder graph "CL""n" is constructible by connecting the four 2-degree vertices in a "straight" way, or by the Cartesian product of a cycle of length "n≥3" and an edge.In symbols, "CL""n" = "C""n" × "P"2.