<?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="Two-graph - Page 1 - Wikipedia">
<p>
<a accesskey="3" href="page.php?w=two-graph&amp;p=2">3.Next</a>
</p>
<p>In <a href="page.php?w=mathematics">mathematics</a>, a <b>two-graph</b> is a set of unordered triples chosen from a finite <b>vertex set</b> X, such that every unordered quadruple from X contains an even number of triples of the two-graph.  A <b>regular</b> two-graph has the property that every pair of vertices lies in the same number of triples of the two-graph.  Two-graphs have been studied because of their connection with <a href="page.php?w=equiangular_lines">equiangular lines</a> and, for regular two-graphs, <a href="page.php?w=strongly_regular_graph">strongly regular graph</a>s,</p><p>
<a accesskey="3" href="page.php?w=two-graph&amp;p=2">3.Next</a>
</p>

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

</card>
</wml>
