Scribd Logo
Upload

Welcome to Scribd!

  • Discrete Mathematics & Graph Theory (20A54304) : Lecture Notes

    Uploaded by

    twaihwcxranwesdiae
    90 views235 pages
    This document contains lecture notes for the course "Discrete Mathematics & Graph Theory" taught at Vemu Institute of Technology. The course aims to introduce concepts of mathematical logic, sets, relations, functions, counting techniques, and graph theory. It is a 3 credit course taught for 3 hours each week. The syllabus covers topics like mathematical logic, set theory, combinatorics, recurrence relations, and graphs. The course outcomes are that students will be able to apply logic to solve problems, identify algebraic structures, apply counting techniques, solve recurrence relations, and apply graph theory to computer science problems.

    Original Description:

    Original Title

    17_02_2023_252595088

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document contains lecture notes for the course "Discrete Mathematics & Graph Theory" taught at Vemu Institute of Technology. The course aims to introduce concepts of mathematical logic, sets, relations, functions, counting techniques, and graph theory. It is a 3 credit course taught for 3 hours each week. The syllabus covers topics like mathematical logic, set theory, combinatorics, recurrence relations, and graphs. The course outcomes are that students will be able to apply logic to solve problems, identify algebraic structures, apply counting techniques, solve recurrence relations, and apply graph theory to computer science problems.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    90 views235 pages

    Discrete Mathematics & Graph Theory (20A54304) : Lecture Notes

    Uploaded by

    twaihwcxranwesdiae
    This document contains lecture notes for the course "Discrete Mathematics & Graph Theory" taught at Vemu Institute of Technology. The course aims to introduce concepts of mathematical logic, sets, relations, functions, counting techniques, and graph theory. It is a 3 credit course taught for 3 hours each week. The syllabus covers topics like mathematical logic, set theory, combinatorics, recurrence relations, and graphs. The course outcomes are that students will be able to apply logic to solve problems, identify algebraic structures, apply counting techniques, solve recurrence relations, and apply graph theory to computer science problems.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 235

    Discrete Mathematics & Graph Theory

    (20A54304)

    Lecture Notes

    II – BTECH

    Prepared by

    Dr.K.R.Sekhar

    Department of Humanities & Sciences

    VEMU INSTITUTE OF TECHNOLOGY


    (Approved by AICTE, New Delhi and Affiliated to JNTUA, Ananthapuramu)
    Accredited by NAAC, NBA ( EEE , ECE & CSE) & ISO 9001-2015 Certified Institution
    Near Pakala. P. Kothakota, Chittoor-Tirupati Highway
    Chittoor, Andhra Pradesh -517112
    Website: www.vemu.org
    R20 Regulations
    JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY ANANTAPUR
    (Established by Govt. of A.P., ACT No.30 of 2008)
    ANANTAPUR – 515 002 (A.P) INDIA

    Course Code L T P C
    Discrete Mathematics &
    20A54304 Graph Theory 3 0 0 3
    Course Objectives
     To introduce the concepts of mathematical logic and gain knowledge in sets, relations and
    functions
     Solve problems using counting techniques and combinatorics
     To introduce generating functions and recurrence relations
     Use Graph Theory for solving real world problems
    Course outcomes (CO) : After completion of the course, the student can able to
    CO-1: Apply mathematical logic to solve problems.
    CO-2: Apply the conceptual background needed and identify structures of algebraic nature
    CO-3: Apply basic counting techniques to solve combinatorial problems.
    CO-4: Formulate problems and solve recurrence relations.
    CO-5: Apply Graph Theory in solving computer science problems
    Syllabus
    UNIT – I- Mathematical Logic
    Introduction, Statements and Notation, Connectives, Well-formed formulas, Tautology, Duality law,
    Equivalence, Implication, Normal Forms, Functionally complete set of connectives, Inference Theory
    of Statement Calculus, Predicate Calculus, Inference theory of Predicate Calculus.
    UNIT – II- Set theory
    Basic Concepts of Set Theory, Relations and Ordering, The Principle of Inclusion Exclusion, Pigeon
    hole principle and its application, Functions composition of functions, Inverse Functions, Recursive
    Functions, Lattices and its properties. Algebraic structures: Algebraic systems-Examples and General
    Properties, Semi groups and Monoids, groups, sub groups, homomorphism, Isomorphism.
    UNIT – III- Elementary Combinatorics
    Basics of Counting, Combinations and Permutations, Enumeration of Combinations and Permutations,
    Enumerating Combinations and Permutations with Repetitions, Enumerating Permutations with
    Constrained Repetitions, Binomial Coefficients, The Binomial and Multinomial Theorems.
    UNIT – IV- Recurrence Relations
    Generating Functions of Sequences, Calculating Coefficients of Generating Functions, Recurrence
    relations, Solving Recurrence Relations by Substitution and Generating functions, The Method of
    Characteristic roots, Solutions of Inhomogeneous Recurrence Relations.
    UNIT – V- Graphs
    Basic Concepts, Isomorphism and Subgraphs, Trees and their Properties, Spanning Trees, Directed
    Trees, Binary Trees, Planar Graphs, Euler’s Formula, Multigraphs and Euler Circuits, Hamiltonian
    Graphs, Chromatic Numbers, The Four Color Problem
    Textbooks:
    1. Joe L. Mott, Abraham Kandel and Theodore P. Baker, Discrete Mathematics for Computer
    Scientists & Mathematicians, 2nd Edition, Pearson Education.
    2. J.P. Tremblay and R. Manohar, Discrete Mathematical Structures with Applications to
    Computer Science, Tata McGraw Hill, 2002
    Reference Books:
    1. Kenneth H. Rosen, Discrete Mathematics and its Applications with Combinatorics and Graph
    Theory, 7th Edition, McGraw Hill Education (India) Private Limited.
    2. Graph Theory with Applications to Engineering and Computer Science by Narsingh Deo.
    Scanned by CamScanner
    Scanned by CamScanner
    Scanned by CamScanner
    Scanned by CamScanner
    Scanned by CamScanner
    Scanned by CamScanner
    Scanned by CamScanner
    Scanned by CamScanner
    Scanned by CamScanner
    Scanned by CamScanner
    Scanned by CamScanner
    Scanned by CamScanner
    Scanned by CamScanner
    Scanned by CamScanner
    Scanned by CamScanner
    Scanned by CamScanner
    Scanned by CamScanner
    Scanned by CamScanner
    Scanned by CamScanner
    Scanned by CamScanner
    Scanned by CamScanner
    Scanned by CamScanner
    Scanned by CamScanner
    Scanned by CamScanner
    Scanned by CamScanner
    Scanned by CamScanner
    Scanned by CamScanner
    Scanned by CamScanner
    Scanned by CamScanner
    Scanned by CamScanner
    Scanned by CamScanner
    Scanned by CamScanner
    Scanned by CamScanner
    Scanned by CamScanner
    Scanned by CamScanner
    Scanned by CamScanner

    You might also like