ladder graph
planar undirected graph with 2n vertices and 3n-2 edges; the Cartesian product of two path graphs, one of which has only one edge
en-US/ˈlædɚ ˈɡɹæf/
en-GB/ˈlædə ɡɹɑːf/
planar undirected graph with 2n vertices and 3n-2 edges; the Cartesian product of two path graphs, one of which has only one edge