信息超图理论 内容简介

in the past years，all concepts in graphs were translated to hypergraphs，in special，the definition of cycles in hypergraphs is the same as in graphs．as extension ofgraphs，there are many results oil trees，cycles，covering and coloring of hypergraphs．

信息超图理论 目录

chapter 1 basic terminologies
chapter 2 relational databases
2.1 operators and operands in relational algebra
2.2 dependences in relations
2.3 entropy
2.4 conflict—free sets of mvds
2.5 consistency of databases
2.6 monotone join expression
chapter 3 some classical results
chapter 4 acyclic hypergraphs
4.1 characteristics of acyclic hypergraphs
4.2 size of acyclic hypergraphs
4.3 enumeration of acyclic hypergraphs
chapter 5 algorithms to test acyclicity of hypergraphs
chapter 6 characteristics of cyclic hypergraphs
chapter 7 three parameters
chapter 8 cycles of hypergraphs
8.1 cycle—axiom of hypergraphs
8.2 cyclomatic numbers of hypergraphs
8.3 extreme value of cyclomatic numbers of hypergraphs
8.4 on size ofunicycle hypergraphs
8.5 m5bius functions
chapter 9 hamiltonian cycles of hypergraphs
chapter 10 decompositions of hypergraphs
10.1 acyclic decompositions of hypergraphs
10.2 a structure decompositions for hypergraphs
bibliography
appendix

信息超图理论 节选

In the past years,all concepts in graphs were translated to hypergraphs,in special,the definition of cycles in hypergraphs is the same as in graphs.As extension of graphs,there are many results on trees,cycles,covering and coloring of hypergraphs.
本书为信息超图理论英文版，适合本科以上文化程度人群阅读。

自然科学 数学 代数数论组合理论

在线阅读