|
GraphTheory[CliqueNumber]
GraphTheory[MaximumClique]
|
|
Calling Sequence
|
|
CliqueNumber(G)
MaximumClique(G)
|
|
|
Description
|
|
|
•
|
CliqueNumber returns the number of vertices in a largest clique of G. MaximumClique returns a list of vertices which comprise a largest clique. The strategy is a branch-and-bound backtracking algorithm using the greedy color bound. (see Kreher and Stinson, 1999)
|
|
|
|
Examples
|
|
|
>
|
|
|
>
|
|
|
| (1) |
|
>
|
|
|
>
|
|
|
| (2) |
|
>
|
|
|
![[4, 5, 6, 7]](/support/helpjp/helpview.aspx?si=6034/file01853/math83.png)
| (3) |
|
|
Download Help Document
Was this information helpful?
