Discrete Mathematics

Author: Geng Suyun Qu Wanling
Publisher:
Publish Date: 2004-02-01
Features: This book is divided into five parts. Part I is on set theory, which includes basic concepts of sets, binary relations, functions, natural numbers, cardinality, and ordinals. Part II is on graph theory, which includes basic concepts of graphs, connectivity of graphs, Eulerian graphs and Hamiltonian graphs, trees, planar graphs, graph coloring, matrix representation of graphs, covering sets, independent sets, matching, weighted graphs, and their applications. Part III is on algebraic structures, which includes basic concepts of algebraic systems and several important algebraic systems: semigroups, groups, rings, fields, lattices, and Boolean algebras. Part IV is on combinatorics, which includes combinatorial existence, combinatorial counting, combinatorial design and coding, as well as combinatorial optimization. Part V is on mathematical logic, which includes propositional logic, first-order predicate logic, Herbrand's theorem, and intuitionistic logic. This book has a rigorous structure, rich content, and is accompanied by numerous examples and exercises, closely integrating theory and practice with computer science. It is not only suitable for undergraduate or graduate students in computer science and related fields but also for use or reference by computer science professionals.