<?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="Circulant graph - Page 9 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Circulant_graph&amp;p=8">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Circulant_graph&amp;p=10">3.Next</a>
</p>
<p>is a graph in which replacing every edge by a non-edge and vice versa produces an <a href="page.php?w=graph_isomorphism">isomorphic graph</a>.For instance, a five-vertex cycle graph is self-complementary, and is also a circulant graph. More generally every <a href="page.php?w=Paley_graph">Paley graph</a> of prime order is a self-complementary circulant graph. <a href="page.php?w=Horst_Sachs">Horst Sachs</a> showed that, if a number  has the property that every prime factor of  is congruent to 1 modulo 4, then there exists a self-complementary</p><p>
<a accesskey="1" href="page.php?w=Circulant_graph&amp;p=8">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Circulant_graph&amp;p=10">3.Next</a>
</p>

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

</card>
</wml>
