<?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="Strongly regular graph - Page 1 - Wikipedia">
<p>
<a accesskey="3" href="page.php?w=strongly_regular_graph&amp;p=2">3.Next</a>
</p>
<p><a href="page.php?w=Image%3APaley13.svg">thumb</a>In <a href="page.php?w=graph_theory">graph theory</a>, a <b>strongly regular graph</b>  (<b>SRG</b>) is a <a href="page.php?w=regular_graph">regular graph</a>  with  vertices and <a href="page.php?w=Degree_%28graph_theory%29">degree</a>  such that for some given integers <br/>
* every two <a href="page.php?w=adjacent_vertices">adjacent vertices</a> have  common neighbours, and<br/>
* every two non-adjacent vertices have  common neighbours.</p>

<p>Such a strongly regular graph is denoted by .</p><p>
<a accesskey="3" href="page.php?w=strongly_regular_graph&amp;p=2">3.Next</a>
</p>

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

</card>
</wml>
