<?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="Edge-transitive graph - Page 6 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=edge-transitive_graph&amp;p=5">1.Previous</a><br />
<a accesskey="3" href="page.php?w=edge-transitive_graph&amp;p=7">3.Next</a>
</p>
<p>cubic graph on 54 vertices, is an example of a regular graph which is edge-transitive but not vertex-transitive. The <a href="page.php?w=Folkman_graph">Folkman graph</a>, a quartic graph on 20 vertices is the smallest such graph.</p>

<p>The <a href="page.php?w=k-vertex-connected_graph">vertex connectivity</a> of an edge-transitive graph always equals its <a href="page.php?w=degree_%28graph_theory%29">minimum degree</a>.</p>

<p><big> See also </big></p>
<p>
* <a href="page.php?w=Edge-transitive">Edge-transitive</a> (in geometry)</p>

<p><big>References</big></p>
<p><big> External links </big></p><p>
<a accesskey="1" href="page.php?w=edge-transitive_graph&amp;p=5">1.Previous</a><br />
<a accesskey="3" href="page.php?w=edge-transitive_graph&amp;p=7">3.Next</a>
</p>

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

</card>
</wml>
