<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Graph of a polytope - Page 5 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Graph_of_a_polytope&amp;p=4">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Graph_of_a_polytope&amp;p=6">3.Next</a>
</p>
<p> is called the -skeleton of the polytope.</p>

<p><big> General properties </big></p>
<p>The edge graph of a <a href="page.php?w=convex_polytope">convex polytope</a> is a finite <a href="page.php?w=simple_graph">simple graph</a>. It is <a href="page.php?w=Connected_graph">connected</a>, since a path between any two vertices can be obtained from the <a href="page.php?w=simplex_algorithm">simplex algorithm</a>.For low-dimensional polytopes the structure of the edge graph is essentially determined by the polytope's dimension:</p>

<p>
* the only 0-dimensional</p><p>
<a accesskey="1" href="page.php?w=Graph_of_a_polytope&amp;p=4">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Graph_of_a_polytope&amp;p=6">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
