Scribd Logo
Upload

Welcome to Scribd!

  • 48 views

    CS309 Graph Theory and Combinatorics

    Uploaded by

    RAJAT DIXIT
    1. The document describes a course on Graph Theory and Combinatorics that introduces fundamental concepts of graph theory including properties and characterization of graphs, trees, and graph algorithms. 2. The course is divided into six modules covering topics such as Euler and Hamiltonian graphs, planar graphs, trees, connectivity, matrix representations of graphs, and graph algorithms. 3. Assessment includes two internal exams, assignments, and an end-semester exam testing knowledge and problem-solving skills across the various modules.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    CS309 Graph Theory and Combinatorics

    Uploaded by

    RAJAT DIXIT
    48 views2 pages
    1. The document describes a course on Graph Theory and Combinatorics that introduces fundamental concepts of graph theory including properties and characterization of graphs, trees, and graph algorithms. 2. The course is divided into six modules covering topics such as Euler and Hamiltonian graphs, planar graphs, trees, connectivity, matrix representations of graphs, and graph algorithms. 3. Assessment includes two internal exams, assignments, and an end-semester exam testing knowledge and problem-solving skills across the various modules.

    Original Title

    CS309 Graph theory and combinatorics

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    1. The document describes a course on Graph Theory and Combinatorics that introduces fundamental concepts of graph theory including properties and characterization of graphs, trees, and graph algorithms. 2. The course is divided into six modules covering topics such as Euler and Hamiltonian graphs, planar graphs, trees, connectivity, matrix representations of graphs, and graph algorithms. 3. Assessment includes two internal exams, assignments, and an end-semester exam testing knowledge and problem-solving skills across the various modules.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    48 views2 pages

    CS309 Graph Theory and Combinatorics

    Uploaded by

    RAJAT DIXIT
    1. The document describes a course on Graph Theory and Combinatorics that introduces fundamental concepts of graph theory including properties and characterization of graphs, trees, and graph algorithms. 2. The course is divided into six modules covering topics such as Euler and Hamiltonian graphs, planar graphs, trees, connectivity, matrix representations of graphs, and graph algorithms. 3. Assessment includes two internal exams, assignments, and an end-semester exam testing knowledge and problem-solving skills across the various modules.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    of 2

    Course L-T-P Year of

    Course Name
    code Credits Introduction
    CS309 GRAPH THEORY AND COMBINATORICS 2-0-2-3 2016
    Prerequisite: Nil
    Course Objectives
     To introduce the fundamental concepts in graph theory, including properties and
    characterization of graphs/ trees and Graphs theoretic algorithms
    Syllabus
    Introductory concepts of graphs, Euler and Hamiltonian graphs, Planar Graphs, Trees, Vertex
    connectivity and edge connectivity, Cut set and Cut vertices, Matrix representation of graphs,
    Graphs theoretic algorithms.
    Expected Outcome
    The Students will be able to
    i. Demonstrate the knowledge of fundamental concepts in graph theory, including
    properties and characterization of graphs and trees.
    ii. Use graphs for solving real life problems.
    iii. Distinguish between planar and non-planar graphs and solve problems.
    iv. Develop efficient algorithms for graph related problems in different domains of
    engineering and science.
    Text Books
    1. Douglas B. West, Introduction to Graph Theory, Prentice Hall India Ltd., 2001
    2. Narasingh Deo, Graph theory, PHI, 1979.
    3. Robin J. Wilson, Introduction to Graph Theory, Longman Group Ltd., 2010
    References
    1. R. Diestel, Graph Theory, free online edition, 2016: diestel-graph-theory.com/basic.html.
    Course Plan
    End
    Sem.
    Module Contents Hours
    Exam
    Marks
    Introductory concepts - What is graph – Application of graphs –
    finite and infinite graphs – Incidence and Degree – Isolated vertex,
    I pendent vertex and Null graph. Paths and circuits – Isomorphism, 09 15 %
    sub graphs, walks, paths and circuits, Connected graphs, disconnect
    graphs.
    Euler graphs, Hamiltonian paths and circuits, Dirac's theorem for
    Hamiltonicity, Travelling salesman problem. Directed graphs –
    II types of digraphs, Digraphs and binary relation
    10 15 %
    FIRST INTERNAL EXAM
    Trees – properties, pendent vertex, Distance and centres - Rooted
    III and binary tree, counting trees, spanning trees. 07 15 %

    Vertex Connectivity, Edge Connectivity, Cut set and Cut Vertices,


    Fundamental circuits, Planar graphs, Different representation of
    IV planar graphs, Euler's theorem, Geometric dual, Combinatorial
    dual. 09 15 %
    SECOND INTERNAL EXAM
    Matrix representation of graphs- Adjacency matrix, Incidence
    Matrix, Circuit matrix, Fundamental Circuit matrix and Rank, Cut
    V
    set matrix, Path matrix 08 20 %
    Graphs theoretic algorithms - Algorithm for computer
    representation of a graph, algorithm for connectedness and 07 20 %
    VI
    components, spanning tree, shortest path.
    END SEMESTER EXAM

    Question Paper Pattern


    1. There will be five parts in the question paper – A, B, C, D, E
    2. Part A
    a. Total marks : 12
    b. Four questions each having 3 marks, uniformly covering modules I and II;
    Allfour questions have to be answered.
    3. Part B
    a. Total marks : 18
    b. Threequestions each having 9 marks, uniformly covering modules I and II;
    Two questions have to be answered. Each question can have a maximum of
    three subparts.
    4. Part C
    a. Total marks : 12
    b. Four questions each having 3 marks, uniformly covering modules III and IV;
    Allfour questions have to be answered.
    5. Part D
    a. Total marks : 18
    b. Threequestions each having 9 marks, uniformly covering modules III and IV;
    Two questions have to be answered. Each question can have a maximum of
    three subparts.
    6. Part E
    a. Total Marks: 40
    b. Six questions each carrying 10 marks, uniformly covering modules V and VI;
    four questions have to be answered.
    c. A question can have a maximum of three sub-parts.
    7. There should be at least 60% analytical/numerical questions.

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy