|
|
|
|
|
A maximal complete subgraph of a graph is a clique, and the clique number $\omega(G)$ of a graph $G$ is the maximal order of a clique in $G$ Simply, $\omega(G)$ is the maximal order of a complete subgraph of $G$ Some authors however define a clique as any complete subgraph of $G$ and refer to the other definition as maximum clique.
|
"clique" is owned by Mathprof. [ full author list (3) | owner history (2) ]
|
|
(view preamble | get metadata)
Cross-references: graph, subgraph
There are 2 references to this entry.
This is version 10 of clique, born on 2002-03-04, modified 2006-09-29.
Object id is 2752, canonical name is Clique2.
Accessed 8202 times total.
Classification:
| AMS MSC: | 05C69 (Combinatorics :: Graph theory :: Dominating sets, independent sets, cliques) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|
