In the mathematical field of graph theory, the ladder graph Ln 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: Ln = Pn □ P2.
In the mathematical field of graph theory, the ladder graph Ln 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: Ln = Pn □ P2.
Source: Wikipedia "Ladder graph" · CC BY-SA 4.0
Share this article: X · Bluesky