GraphTheory - Maple Programming Help

Online Help

All Products    Maple    MapleSim


Home : Support : Online Help : Mathematics : Discrete Mathematics : Graph Theory : GraphTheory Package : GraphTheory/IsClique

GraphTheory

  

IsClique

 

Calling Sequence

Parameters

Description

Examples

Calling Sequence

IsClique(G)

IsClique(G,S)

Parameters

G

-

undirected graph

S

-

(optional) list or set of vertices

Description

• 

The IsClique(G) command returns true if the input graph is a clique (complete graph).  It returns false otherwise.

• 

The IsClique(G, S) command returns true if the collection of vertices S represents a clique in G, and returns false otherwise.

Examples

withGraphTheory:

K3CompleteGraph3

K3Graph 1: an undirected unweighted graph with 3 vertices and 3 edge(s)

(1)

IsCliqueK3

true

(2)

C4CycleGraph4

C4Graph 2: an undirected unweighted graph with 4 vertices and 4 edge(s)

(3)

IsCliqueC4

false

(4)

GAddEdgeC4,1,3,inplace=false

GGraph 3: an undirected unweighted graph with 4 vertices and 5 edge(s)

(5)

IsCliqueG,1,2,3

true

(6)

See Also

CliqueNumber

InducedSubgraph

MaximumClique