Scribd
Upload
493 views1 page

Discrete Mathematics and Its Applications: Kenneth H Rosen Seventh Edition

This document summarizes key concepts from Discrete Mathematics and Its Applications by Kenneth H. Rosen, including definitions of basic logical statements and relations like propositions, negation, conjunction, disjunction, conditional statements, and biconditionals. It also covers proof techniques like direct proofs, proofs by contradiction and contraposition. Additional topics include functions, trees, graph representations, and algorithms for graph traversal as well as famous problems involving graphs like the Konigsberg bridge problem and Hamilton circuits.

Uploaded by

Sajjad Shamim
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
493 views1 page

Discrete Mathematics and Its Applications: Kenneth H Rosen Seventh Edition

This document summarizes key concepts from Discrete Mathematics and Its Applications by Kenneth H. Rosen, including definitions of basic logical statements and relations like propositions, negation, conjunction, disjunction, conditional statements, and biconditionals. It also covers proof techniques like direct proofs, proofs by contradiction and contraposition. Additional topics include functions, trees, graph representations, and algorithms for graph traversal as well as famous problems involving graphs like the Konigsberg bridge problem and Hamilton circuits.

Uploaded by

Sajjad Shamim
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Discrete Mathematics and Its applications:

Kenneth H Rosen
Seventh Edition

1. Definition of proposition. Example 1, Example 2------------- Page 2


2. Negation, Conjunction, Disjunction -----------------page 3 and page 4
3. Conditional Statement ----------------Page 5 , 6
4. Bi Conditional --------------------------- page 9
5. Example 13 ----------------------------- Page 13
6. Tautology, Contradiction, Contrapositive, Logical Equivalence -------------- Page 21, 22, 23
7. Rules of Inference ------------- Page 61,62,63 Example 6, 7, 8
8. Proof Techniques ------------- Direct Proof, Proof by contrapositive, Proof by contradiction ----
Page 75 – Example 1; Page 76 – Example 3; Page 78 – Example 8; Page 79 – Example 11
9. Definition of function --- Page 142
10. One-to-one function --- Page 145
11. Onto Function -------Page 146
12. Inverse Function -------- Page 147
13. Page 147 ---- Figure 5
14. Trees—Page 652, 653, 655 – In-order, Pre-order, post-order traversal algorithms
15. Page 657,658 --- Infix, Prefix, Postfix notation … Example 5,6,7,8
16. Definition of Graphs --- Page 527
17. Representation of Graphs: Adjacency matrices, Adjacency List ------- 550, 551
18. Page 571 --- Konigsberg Bridge Problem, Euler Path and Euler Circuit
19. Page 572 – Example 1, Example 2
20. Page 576 --- Hamilton Paths and Hamilton Circuits ---
21. Page 577 --- Example 5

You might also like