<?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="Directed graph - Page 7 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Directed_graph&amp;p=6">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Directed_graph&amp;p=8">3.Next</a>
</p>
<p>the edges replaced by pairs of inverse arcs). It follows that a complete digraph is symmetric.<br/>
** <b>Semicomplete multipartite digraphs</b> are simple digraphs in which the vertex set is partitioned into sets such that for every pair of vertices x and y in different sets, there is an arc between x and y. There can be one arc between x and y or two arcs in opposite directions.<br/>
** <b>Semicomplete digraphs</b> are simple digraphs where there is an arc between each pair of vertices. Every semicomplete digraph is a semicomplete multipartite</p><p>
<a accesskey="1" href="page.php?w=Directed_graph&amp;p=6">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Directed_graph&amp;p=8">3.Next</a>
</p>

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

</card>
</wml>
