test if graph is a clique
(optional) list or set of vertices
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.
K3 ≔ CompleteGraph⁡3
K3≔Graph 1: an undirected graph with 3 vertices and 3 edge(s)
C4 ≔ CycleGraph⁡4
C4≔Graph 2: an undirected graph with 4 vertices and 4 edge(s)
G ≔ AddEdge⁡C4,1,3,inplace=false
G≔Graph 3: an undirected graph with 4 vertices and 5 edge(s)
Download Help Document
What kind of issue would you like to report? (Optional)