Kneser graph

名词 n.

英文释义

名词 n.
  1. A graph K(n, k) (alternatively KG_(n,k)), whose vertices correspond to the k-element subsets of a set of n elements, and where two vertices are adjacent iff the two corresponding sets are disjoint.

词形变化

Kneser graphs plural

词源

Named after Martin Kneser, who first investigated them in 1956.
1 次浏览 数据来源: Wiktionary