<?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="Clique (graph theory) - Page 1 - Wikipedia">
<p>
<a accesskey="3" href="page.php?w=Clique_%28graph_theory%29&amp;p=2">3.Next</a>
</p>
<p>In <a href="page.php?w=graph_theory">graph theory</a>, a <b>clique</b> ( or ) is a subset of vertices of an <a href="page.php?w=undirected_graph">undirected graph</a> such that every two distinct vertices in the clique are <a href="page.php?w=Adjacent_%28graph_theory%29">adjacent</a>. That is, a clique of a graph  is an <a href="page.php?w=induced_subgraph">induced subgraph</a> of  that is <a href="page.php?w=complete_graph">complete</a>. Cliques are one of the basic concepts of graph theory and are used in many other mathematical problems and</p><p>
<a accesskey="3" href="page.php?w=Clique_%28graph_theory%29&amp;p=2">3.Next</a>
</p>

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

</card>
</wml>
