construct Turan graph
The TuranGraph(n,k) command returns the Turán graph with parameters n, k.
The Turán graph is the complete k-partite graph on n vertices whose partitions are as close to equal in cardinality as possible.
G ≔ TuranGraph⁡5,3
G≔Graph 1: an undirected graph with 5 vertices and 8 edge(s)
G ≔ TuranGraph⁡5,4
G≔Graph 2: an undirected graph with 5 vertices and 9 edge(s)
"Turán graph", Wikipedia. http://en.wikipedia.org/wiki/Turan_graph
The GraphTheory[SpecialGraphs][TuranGraph] command was introduced in Maple 2018.
For more information on Maple 2018 changes, see Updates in Maple 2018.
Download Help Document