We shall consider partitions of the edges of graphs and hypergraphs.
我们将考虑图和超图的边的划分。
This paper will use such non-constructive probabilistic method to solve the problems in coloring theory of mixed-hypergraphs.
本文主要就是利用这种非构造性概率方法来解决混合超图染色理论中的一些问题。
Then the counting series are derived for undirected unlabeled and labeled hypergraphs, thus the isomorphism and counting problems of undirected hypergraphs are solved.
导出了无向无标号超图和标号超目的计数级数，解决了无向超图的同构和计数问题。
The domination sets and perfect domination sets in hypergraphs are researched, and the conditions of sufficient and necessary of domination sets and perfect domination sets are given.
研究超图的控制集和完美控制集并给出超图的控制集和完美控制集存在的充分必要条件。
The domination sets and perfect domination sets in hypergraphs are researched, and the conditions of sufficient and necessary of domination sets and perfect domination sets are given.
研究超图的控制集和完美控制集并给出超图的控制集和完美控制集存在的充分必要条件。
应用推荐