Turán graph

English

Etymology

Named after the Hungarian mathematician Pál Turán.

Noun

Turán graph (plural Turán graphs)

(graph theory) A complete multipartite graph T(n,r) formed by partitioning a set of n vertices into r subsets, with sizes as equal as possible, and connecting two vertices by an edge if and only if they belong to different subsets.

Hyponyms

cocktail party graph

Related terms

Turán's theorem

This article is issued from Wiktionary. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.