Discrete Mathematics Tutorial University-level Computer Science Textbooks and Professional Basic Course Series (Geng Suyun)

Author: Geng Suyun, Qu Wanling, Wang Hanpin (editors)
Publisher:
Publish Date: 2004-02-01
Features: This book is divided into five parts. Part I is on set theory, including basic concepts of sets, binary relations, functions, natural numbers, cardinality, and ordinals. Part II is on graph theory, covering basic concepts of graphs, connectivity of graphs, Eulerian and Hamiltonian graphs, trees, planar graphs, graph coloring, matrix representation of graphs, covering sets, independent sets, matchings, weighted graphs, and their applications. Part III is on algebraic structures, including basic concepts of algebraic systems and several important algebraic systems: semigroups, groups, rings, fields, lattices, and Boolean algebras. Part IV is on combinatorics, encompassing combinatorial existence, combinatorial counting, combinatorial design and coding, as well as combinatorial optimization. Part V is on mathematical logic, including 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 suitable not only for undergraduate or graduate students in computer science and related fields but also for computer professionals for use or reference.