<?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 4 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=edge-transitive_graph&amp;p=3">1.Previous</a><br />
<a accesskey="3" href="page.php?w=edge-transitive_graph&amp;p=5">3.Next</a>
</p>
<p> where m != n, which includes the star graphs . For graphs on n vertices, there are (n-1)/2 such graphs for odd n and (n-2) for even n.Additional edge transitive graphs which are not symmetric can be formed as subgraphs of these complete bi-partite graphs in certain cases. Subgraphs of complete bipartite graphs K<sub>m,n</sub> exist when m and n share a factor greater than 2. When the greatest common factor is 2, subgraphs exist when 2n/m is even or if m=4 and n is an odd multiple of 6. So edge transitive subgraphs exist for K<sub>3,6</sub>,</p><p>
<a accesskey="1" href="page.php?w=edge-transitive_graph&amp;p=3">1.Previous</a><br />
<a accesskey="3" href="page.php?w=edge-transitive_graph&amp;p=5">3.Next</a>
</p>

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

</card>
</wml>
