<?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 theory - Page 5 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Graph_theory&amp;p=4">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Graph_theory&amp;p=6">3.Next</a>
</p>
<p>designated with an arrow. A <a href="page.php?w=mixed_graph">mixed graph</a> can have edges that may be directed, and some may be undirected. A graph can also be called a simple graph, to distinguish it from a <a href="page.php?w=multigraph">multigraph</a>. A multigraph allows many edges to have the same pair of endpoints, and it also allows an edge to connect a vertex to itself, known as a <a href="page.php?w=Loop_%28graph_theory%29">loop</a>. A graph can have its edges assigned a number, which is known as the weight. Such a graph is called</p><p>
<a accesskey="1" href="page.php?w=Graph_theory&amp;p=4">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Graph_theory&amp;p=6">3.Next</a>
</p>

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

</card>
</wml>
