co-hypergraphs 反超图
random uniform hypergraphs 门槛函数
C-Cycles in Hypergraphs 超图中的C
Longest cycles in hypergraphs 超图的最长圈
totaly irregular co-hypergraphs 完全不规则反超图
Hypergraphs considered here are finite and simple.
本文我们所考虑的超图都是有限的，简单的。
参考来源 - 关于一致超图的导出匹配可扩张性In this thesis, hypergraphs are suggested as models of the optical interconnection networks.2: The researches in optical interconnection have concentrated on optic components/ devices and network models.
基于以上原因,给出了一种光互连网络建模方法──基于超图理论的方法,并分析了超图理论应用在光互连网络模型研究中的优越性。
参考来源 - 大规模并行计算机光互连网络研究·2,447,543篇论文数据，部分数据来源于NoteExpress
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.
导出了无向无标号超图和标号超目的计数级数，解决了无向超图的同构和计数问题。
应用推荐