TuranGraph

TuranGraph[n,k]

gives the k-partite Turán graph with n vertices .

Details and Options

  • The Turán graph is the complete k-partite graph with n vertices whose partite sets are as nearly equal in cardinality as possible.
  • The Turán graph is equivalent to a complete k-partite graph CompleteGraph[{n1,,nk}], where ni is either TemplateBox[{{n, /, k}}, Ceiling] or TemplateBox[{{n, /, k}}, Floor].
  • TuranGraph takes the same options as Graph.

Examples

open allclose all

Basic Examples  (1)

The first few Turán graphs with 5 vertices:

In[1]:=
Click for copyable input
Out[1]=

Options  (79)

Applications  (7)

Properties & Relations  (4)

See Also

Graph  GraphData  CompleteGraph

Introduced in 2010
(8.0)