 Ladder graph

In the mathematical field of graph theory, the ladder graph "L""n" is a planar undirected graph with "2n" vertices and "3n-2" edges.The ladder graph can be obtained as the Cartesian product of two path graphs, one of which has only one edge