# 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

**Wikidata**: [Q6469318](https://www.wikidata.org/wiki/Q6469318)  
**Wikipedia**: [English](https://en.wikipedia.org/wiki/Ladder_graph)  
**Source**: https://4ort.xyz/entity/ladder-graph
