This book introduce the hypergraph theory which come from database theory. Main contents are property of acyclic hypergraph and properties of cycle structure of hypergraph. The cycle axiom constitutes the foundation of the theory. The cycle axiom defines a cycle of hypergraph from global structure of the hypergraph. This is a new module in discrete mathematics. The book can be reference for teachers, engineers and graduate students in information science, compute science, etc.
样章试读
暂时还没有任何用户评论
全部咨询(共0条问答)
暂时还没有任何用户咨询内容
目录
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 of unicycle hypergraphs 8.5 Mobius 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