K = completeGraph n
A complete graph on n vertices is a graph in which all the vertices are adjacent to each other.
|
The object completeGraph is a method function.
The source of this document is in /build/reproducible-path/macaulay2-1.25.05+ds/M2/Macaulay2/packages/Graphs.m2:2448:0.