Menu
Home
People
Places
Arts
History
Plants & Animals
Science
Life & Culture
Technology
Reference.org
Nested triangles graph
open-in-new
<p>In <a href="/facts/Graph_theory/VVPCd4TX">graph theory</a>, a nested triangles graph with <i>n</i> <a href="/facts/Vertex_(graph_theory)/WhlWmL3o">vertices</a> is a <a href="/facts/Planar_graph/plREagr9">planar graph</a> formed from a sequence of <i>n</i>/3 triangles, by connecting pairs of corresponding vertices on consecutive triangles in the sequence. It can also be formed geometrically, by gluing together <i>n</i>/3 − 1 <a href="/facts/Triangular_prism/Yjp4Kw9M">triangular prisms</a> on their triangular faces. This graph, and graphs closely related to it, have been frequently used in <a href="/facts/Graph_drawing/uhh73BVo">graph drawing</a> to prove lower bounds on the <a href="/facts/Area_(graph_drawing)/yPPIE7Gw">area requirements</a> of various styles of drawings. </p>