Discrete Mathematics and Graph Theory. A complete solution for Computer Science and IT

      Аннотация: This textbook, “Discrete Mathematics and Graph Theory”, provides a good overview of topics in Discrete Mathematics. The primary focus of this text is not to provide a rigorous mathematical foundation for Computer Science students; instead, it is targeted towards first and second year undergraduate math majors. The text starts with a brief but useful introduction to mathematical concepts (mathematical propositions, normal forms and inference theory), and then goes on to cover a range of topics in depth, broken up into several main sections: Combinations, Sequences, Symbolic Logic and Proofs, and Graph Theory, as well an Additional Topics section that touches on Generating Functions and provides an introduction to Graph Theory. The material touches on a wide array of concepts such as the Pigeonhole principle, The text has several features that I found quite innovative and helpful. The presentation takes an solution-based approach, and most topics has number of questions or problems to help motivate students to understand the context for the topic they’re about to start The text also approaches mathematical proofs in a friendly, non-intimidating manner.

Ключевые слова: Proposition, permutation, combination, function