|
GraphTheory[IsClique]
|
|
Calling Sequence
|
|
IsClique(G)
|
|
|
Description
|
|
|
•
|
The IsClique command returns true if the input graph is a clique (complete graph). It returns false otherwise.
|
|
•
|
To test whether a graph contains a clique (on a particular set of vertices) use the InducedSubgraph command first.
|
|
|
|
Examples
|
|
|
>
|
|
|
>
|
|
|
| (1) |
|
>
|
|
|
| (2) |
|
>
|
|
|
| (3) |
|
>
|
|
|
| (4) |
|
>
|
|
|
| (5) |
|
>
|
![IsClique(InducedSubgraph(G, [1, 2, 3]))](/support/helpjp/helpview.aspx?si=6075/file01830/math92.png)
|
|
| (6) |
|
|
Download Help Document
Was this information helpful?
