GraphTheory[SpecialGraphs] - Maple Programming Help

Online Help

All Products    Maple    MapleSim


Home : Support : Online Help : Mathematics : Discrete Mathematics : Graph Theory : GraphTheory Package : SpecialGraphs : GraphTheory/SpecialGraphs/TuranGraph

GraphTheory[SpecialGraphs]

  

TuranGraph

  

construct Turan graph

 

Calling Sequence

Parameters

Description

Examples

References

Compatibility

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

withGraphTheory:withSpecialGraphs:

GTuranGraph5,3

GGraph 1: an undirected unweighted graph with 5 vertices and 8 edge(s)

(1)

NumberOfEdgesG

8

(2)

GTuranGraph5,4

GGraph 2: an undirected unweighted graph with 5 vertices and 9 edge(s)

(3)

NumberOfEdgesG

9

(4)

DrawGraphG

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.

See Also

SpecialGraphs