Discrete mathematics

"Focused on helping students understand and construct proofs and expanding their mathematical maturity, this best-selling text is an accessible introduction to discrete mathematics. Johnsonbaugh's algorithmic approach emphasizes problem-solving techniques. The Seventh Edition reflects user and reviewer feedback on both content and organization". --Publisher.

"Pearson new international edition."

6.1 Basic Principles -- Problem-Solving Corner: Counting -- 6.2 Permutations and Combinations -- Problem-Solving Corner: Combinations -- 6.3 Generalized Permutations and Combinations -- 6.4 Algorithms for Generating Permutations and Combinations -- 6.5 Introduction to Discrete Probability -- 6.6 Discrete Probability Theory -- 6.7 Binomial Coefficients and Combinatorial Identities -- 6.8 The Pigeonhole Principle -- 7 Recurrence Relations -- 7.1 Introduction -- 7.2 Solving Recurrence Relations -- Problem-Solving Corner: Recurrence Relations -- 7.3 Applications to the Analysis of Algorithms -- 8 Graph Theory -- 8.1 Introduction -- 8.2 Paths and Cycles -- Problem-Solving Corner: Graphs -- 8.3 Hamiltonian Cycles and the Traveling Salesperson Problem -- 8.4 A Shortest-Path Algorithm -- 8.5 Representations of Graphs -- 8.6 Isomorphisms of Graphs -- 8.7 Planar Graphs -- 8.8 Instant Insanity -- 9 Trees -- 9.1 Introduction -- 9.2 Terminology and Characterizations of Trees -- Problem-Solving Corner: Trees -- 9.3 Spanning Trees -- 9.4 Minimal Spanning Trees -- 9.5 Binary Trees -- 9.6 Tree Traversals -- 9.7 Decision Trees and the Minimum Time for Sorting -- 9.8 Isomorphisms of Trees -- 9.9 Gam…