CompleteGraph(n1, n2,..., nk)
list of integers, strings or symbols (vertex labels)
CompleteGraph(n) returns the complete graph on n vertices. CompleteGraph(V) does the same thing except the vertices are labeled using the entries of V.
CompleteGraph(n, m) returns the complete bipartite graph with bipartitions of size n and m.
CompleteGraph(n1,...,nk) returns the complete multipartite graph with partitions of size n1,..., nk.
K4 ≔ CompleteGraph⁡4
K4 ≔ Graph 1: an undirected unweighted graph with 4 vertices and 6 edge(s)
K23 ≔ CompleteGraph⁡2,3
K23 ≔ Graph 2: an undirected unweighted graph with 5 vertices and 6 edge(s)
Download Help Document
What kind of issue would you like to report? (Optional)
Thank you for submitting feedback on this help document. Your feedback will be used
to improve Maple's help in the future.