Turán graph
名词 n.
英文释义
名词 n.
- 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.
词形变化
词源
Named after the Hungarian mathematician Pál Turán.
0 次浏览
数据来源: Wiktionary