http://openproblemgarden.org/op/cores_of_strongly_regular_graphs Comments for "Cores of strongly regular graphs" en http://openproblemgarden.org/op/cores_of_strongly_regular_graphs#comment-7064 <p>I believe you mean "Godsil and Royle", not "Gordon and Royle".</p> Tue, 18 Oct 2011 03:32:00 +0200 Anonymous comment 7064 at http://openproblemgarden.org http://openproblemgarden.org/op/cores_of_strongly_regular_graphs <table cellspacing="10"> <tr> <td> Author(s): <a href="/category/cameron_peter_j">Cameron</a>; <a href="/category/kazanidis_priscila_a">Kazanidis</a>&nbsp;&nbsp; </td> <td align=right> Subject: <a href="/category/graph_theory">Graph Theory</a> » <a href="/category/algebraical_graph_theory">Algebraic G.T.</a>&nbsp;&nbsp; </td> </tr> <tr> <td colspan=2> <table border=1 cellspacing="5"> <tr><td> <div class="envtheorem"><b>Question</b>&nbsp;&nbsp; Does every <a href="http://en.wikipedia.org/wiki/strongly regular graph">strongly regular graph</a> have either itself or a complete graph as a <a href="http://en.wikipedia.org/wiki/core (graph theory)">core</a>? </div> </tr></td> </table> </td> </tr> </table> Cameron, Peter J. Kazanidis, Priscila A. core strongly regular Graph Theory Algebraic Graph Theory http://openproblemgarden.org/op/cores_of_strongly_regular_graphs#comment Mon, 16 Jun 2008 12:48:11 +0200 mdevos 824 at http://openproblemgarden.org