Crown graphとは 意味・読み方・使い方

In graph theory, a branch of mathematics, a crown graph on 2n vertices is an undirected graph with two sets of vertices u_i and v_i and with an edge from u_i to v_j whenever i ≠ j. The crown graph can be viewed as a complete bipartite graph from which the edges of a perfect matching have been removed, as the bipartite double cover of a complete graph, or as a bipartite Kneser graph H_n,1 representing the 1-item and (n − 1)-item subsets of an n-item set, with an edge between two subsets whenever one is contained in the other.