Turán graph
Turán graph noun: 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.
Noun
Turán graph (plural Turán graphs)
Forms of Turán graph
| plural | Turán graphs |
|---|
Origin of Turán graph
Named after the Hungarian mathematician Pál Turán.
Questions about Turán graph
- What does Turán graph mean?
- Turán graph means 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.
- What part of speech is Turán graph?
- Turán graph is a noun.
- What is the plural of Turán graph?
- The plural of Turán graph is Turán graphs.
Words near Turán graph in the dictionary
Source and license
Adapted from Wiktionary: Turán graph (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.
Last updated:
Cite this entry: “Turán graph.” Word.ws, https://word.ws/tur%C3%A1n_graph. Based on Wiktionary, CC BY-SA 4.0.
