DISCRETE MATHEMATICAL STRUCTURES

Unit-I

Fundamentals of logic, logical inference, methods of proof of an implication, first order logic and other methods of proof , rules of inference for quantitative proposition, mathematical induction.

Unit-II

Review of sets, Fuzzy sets, relations and functions, binary relations, equivalence relations, lattices, operations of relations, path and closures directed graphs , Adjacency matrices.

Unit-III

Combination and permutation: With repetitions permutations , with constant repetition, principle  of inclusion and exclusion, generating functional recurrence relations and their solutions. 

Unit-1V

Basic concept of graphs, isomorphism and sub-graphs, tree and their properties, spanning trees.

Unit-V

Directed trees, binary trees, planner graph , Euler's formula, multi-graph s and Euler's circuits, Hamiltonian graphs.

Books

• Mott, J.L., Kandel, A. & baker, T.P:Discrete Mathematics for Computer Science and Mathematics, 2/ed(PHI,!999)