TuranGraph - Maple Help

GraphTheory[SpecialGraphs]

 TuranGraph
 construct Turan graph

 Calling Sequence TuranGraph(n,k)

Parameters

 n, k - positive integers

Description

 • 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.

Examples

 > $\mathrm{with}\left(\mathrm{GraphTheory}\right):$$\mathrm{with}\left(\mathrm{SpecialGraphs}\right):$
 > $G≔\mathrm{TuranGraph}\left(5,3\right)$
 ${G}{≔}{\mathrm{Graph 1: an undirected unweighted graph with 5 vertices and 8 edge\left(s\right)}}$ (1)
 > $\mathrm{NumberOfEdges}\left(G\right)$
 ${8}$ (2)
 > $G≔\mathrm{TuranGraph}\left(5,4\right)$
 ${G}{≔}{\mathrm{Graph 2: an undirected unweighted graph with 5 vertices and 9 edge\left(s\right)}}$ (3)
 > $\mathrm{NumberOfEdges}\left(G\right)$
 ${9}$ (4)
 > $\mathrm{DrawGraph}\left(G\right)$

References

 "Turán graph", Wikipedia. http://en.wikipedia.org/wiki/Turan_graph

Compatibility

 • The GraphTheory[SpecialGraphs][TuranGraph] command was introduced in Maple 2018.
 • For more information on Maple 2018 changes, see Updates in Maple 2018.