<?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="Connectedness - Page 4 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Connectedness&amp;p=3">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Connectedness&amp;p=5">3.Next</a>
</p>
<p>in such fields. For example, a graph is said to be <a href="page.php?w=connected_graph">connected</a> if each pair of <a href="page.php?w=vertex_%28graph_theory%29">vertices</a> in the graph is joined by a <a href="page.php?w=path_%28graph_theory%29">path</a>. This definition is equivalent to the topological one, as applied to graphs, but it is easier to deal with in the context of <a href="page.php?w=graph_theory">graph theory</a>. Graph theory also offers a context-free measure of connectedness, called the <a href="page.php?w=clustering_coefficient">clustering coefficient</a>.</p><p>
<a accesskey="1" href="page.php?w=Connectedness&amp;p=3">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Connectedness&amp;p=5">3.Next</a>
</p>

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

</card>
</wml>
