The intersection number, in (G), has been defined as the minimumcardinality of a set S which has n different subsets S_i such that each S_i can beassigned to the node v_i of G and nodes v_i, v_j are adjacent if and on...The intersection number, in (G), has been defined as the minimumcardinality of a set S which has n different subsets S_i such that each S_i can beassigned to the node v_i of G and nodes v_i, v_j are adjacent if and onlyif S_i∩S_j ≠0. We introduce the multiset intersection number min (G), defined similarly exceptthat multisets with elements in S may now be assigned to the nodes of G. Weprove that min (G) equals the smallest number ofcliques of G whose union is G.展开更多
文摘The intersection number, in (G), has been defined as the minimumcardinality of a set S which has n different subsets S_i such that each S_i can beassigned to the node v_i of G and nodes v_i, v_j are adjacent if and onlyif S_i∩S_j ≠0. We introduce the multiset intersection number min (G), defined similarly exceptthat multisets with elements in S may now be assigned to the nodes of G. Weprove that min (G) equals the smallest number ofcliques of G whose union is G.
