<?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="Biregular graph - Page 2 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=biregular_graph&amp;p=1">1.Previous</a><br />
<a accesskey="3" href="page.php?w=biregular_graph&amp;p=3">3.Next</a>
</p>
<p> is -biregular.The <a href="page.php?w=rhombic_dodecahedron">rhombic dodecahedron</a> is another example; it is (3,4)-biregular.</p>

<p><big>Vertex counts</big></p>
<p>An -biregular graph  must satisfy the equation . This follows from a simple <a href="page.php?w=Double_counting_%28proof_technique%29">double counting argument</a>: the number of endpoints of edges in  is , the number of endpoints of edges in  is , and each edge contributes the same amount (one) to both numbers.</p>

<p><big>Symmetry</big></p>
<p>Every <a href="page.php?w=regular_graph">regular</a></p><p>
<a accesskey="1" href="page.php?w=biregular_graph&amp;p=1">1.Previous</a><br />
<a accesskey="3" href="page.php?w=biregular_graph&amp;p=3">3.Next</a>
</p>

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

</card>
</wml>
