Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Ladder graph
open-in-new
<p>In the <a href="/facts/Mathematics/pxTouaz4">mathematical</a> field of <a href="/facts/Graph_theory/VVPCd4TX">graph theory</a>, the ladder graph Ln is a <a href="/facts/Planar_graph/plREagr9">planar</a>, <a href="/facts/Undirected_graph/kw3eIBUe">undirected graph</a> with 2<i>n</i> <a href="/facts/Vertex_(graph_theory)/WhlWmL3o">vertices</a> and 3<i>n</i> − 2 edges. </p><p>The ladder graph can be obtained as the <a href="/facts/Cartesian_product_of_graphs/wC4JJdyU">Cartesian product</a> of two <a href="/facts/Path_graph/4Y2f35eM">path graphs</a>, one of which has only one edge: <i>L</i><i>n</i>,1 = <i>P</i><i>n</i> × <i>P</i>2. </p>