Discrete Mathematics Tutorial: A Series of Textbooks for Computer Science Majors and Professional Foundation Courses in Higher Education

Author: Geng Suyun
Publisher:
Publish Date: 2004-02-01
Features: This book is divided into five parts. Part I is on Set Theory, which includes the basic concepts of sets, binary relations, functions, natural numbers, cardinality, and ordinals. Part II is on Graph Theory, which includes the basic concepts of graphs, graph connectivity, Eulerian graphs and Hamiltonian graphs, trees, planar graphs, graph coloring, matrix representations of graphs, cover sets, independent sets, matchings, weighted graphs, and their applications. Part III is on Algebraic Structures, which includes the 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. This book is not only suitable for undergraduate or graduate students in computer science and related fields but can also be used or referenced by computer science professionals.