<?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="Cycle graph - Page 1 - Wikipedia">
<p>
<a accesskey="3" href="page.php?w=Cycle_graph&amp;p=2">3.Next</a>
</p>
<p>In <a href="page.php?w=graph_theory">graph theory</a>, a <b>cycle graph</b> or <b>circular graph</b> is a <a href="page.php?w=Graph_%28discrete_mathematics%29">graph</a> that consists of a single <a href="page.php?w=Cycle_%28graph_theory%29">cycle</a>, or in other words, some number of <a href="page.php?w=Vertex_%28graph_theory%29">vertices</a> (at least 3, if the graph is <a href="page.php?w=Simple_graph">simple</a>) connected in a closed chain. The cycle graph with  vertices is called . The number of vertices in  equals the number of <a href="page.php?w=Edge_%28graph_theory%29">edge</a>s,</p><p>
<a accesskey="3" href="page.php?w=Cycle_graph&amp;p=2">3.Next</a>
</p>

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

</card>
</wml>
