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
Facts
5 properties- Subclass of
- square grid graph, outerplanar graph, bivariegated graph, pairwise compatibility graph[1][2][3][4]
- Defining formula
- L_n = P_2 \mathbin\square P_n[6]
- Different from
- ladder rung graph[5]
- Studied by
- graph theory[7]
🏷️ Also known as
en ladder graph
cs žebřík
de Leitergraph
fr Graphe en échelle
hu létragráf
it Scala (grafo)
ru лестница
ru лестница (граф)
ru лестница (теория графов)
uk граф-драбина
uk драбина
🔖 Identifiers · 5
- Image (Wikimedia Commons)
- Ladder graphs.svg ↗
- Freebase ID
- /m/07s88tw
- MathWorld ID
- LadderGraph
- Microsoft Academic ID (discontinued)
- 2779135755
- Wolfram Language entity code
- Entity["GraphClass", "Ladder"]
🔗 Connections
Maintained by WikiProject 1
Studied by 1
Subclass of 1
Press Enter · cited answer in seconds