Kneser graph

短语

词形变化

Kneser graphs 复数 Kneser graphs

释义与例句

n.
  1. 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.

    数学

词源

Named after Martin Kneser, who first investigated them in 1956.

来源：wiktionary