Ladder graph
id:
ladder-graph-279-6509308
title:
Ladder graph
text:
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,1 = Pn × P2.
brand slug:
wiki
category slug:
encyclopedia
description:
Planar, undirected graph with 2n vertices and 3n-2 edges
original url:
https://en.wikipedia.org/wiki/Ladder_graph
date created:
date modified:
2023-10-12T16:13:27Z
main entity:
{"identifier":"Q6469318","url":"https://www.wikidata.org/entity/Q6469318"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/c/c1/Ladder_graph_L8.svg","width":81,"height":116}
fields total:
13
integrity:
15