Scribd Logo
Upload

Welcome to Scribd!

  • 4 views

    Maths

    Uploaded by

    vivek yadav
    Wytriu and creation of god I hope you will find a good. Paper because, I was also doing research. Why this ghatiya subject is in my syllabus, I hope you will research on this topic and find you well

    Copyright:

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

    Maths

    Uploaded by

    vivek yadav
    4 views2 pages
    Wytriu and creation of god I hope you will find a good. Paper because, I was also doing research. Why this ghatiya subject is in my syllabus, I hope you will research on this topic and find you well

    Original Title

    maths

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Wytriu and creation of god I hope you will find a good. Paper because, I was also doing research. Why this ghatiya subject is in my syllabus, I hope you will research on this topic and find you well

    Copyright:

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

    Maths

    Uploaded by

    vivek yadav
    Wytriu and creation of god I hope you will find a good. Paper because, I was also doing research. Why this ghatiya subject is in my syllabus, I hope you will research on this topic and find you well

    Copyright:

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

    Department of Mathematics, University of Delhi

    Teaching Plan: B.A. (Prog.) with Mathematics as Major,


    and B.Sc. (Physical Sc./Mathematical Sc.), Semester-4
    DSC-4, and DSE-2(ii): Introduction to Graph Theory
    Week 1: Graphs and their representation, Pseudographs, Subgraphs, Degree sequence, Euler’s theorem.
    [1]: Chapter 9 (Sections 9.1, and 9.2).

    Week 2: Isomorphism of Graphs, Paths and Circuits, Connected graphs, Eulerian circuits.
    [1]: Chapter 9 (Section 9.3).
    [1]: Chapter 10 (Section 10.1 [Theorems 10.1.4, and 10.1.5 without proofs]).

    Week 3: Hamiltonian paths cycles, Adjacency Matrix.


    [1]: Chapter 10 (Sections 10.2 [Theorems 10.2.4, and 10.2.6 without proofs, exclude 10.2.3], and 10.3).

    Week 4: Weighted graphs, Travelling salesman problem, Shortest path problem, Dijkstra’s algorithm
    (without proof), Dijkstra’s algorithm improved (without proof).
    [1]: Chapter 10 (Section 10.4 up to 10.4.3 [applications only]).

    Week 5: The Chinese postman problem; Digraphs, Bellman-Ford algorithm.


    [1]: Chapter 11 (Sections 11.1, and 11.2).

    Week 6: Tournaments, Directed network, Scheduling problem.


    [1]: Chapter 11 (Sections 11.4, and 11.5).

    Weeks 7 and 8: Trees and their properties, Spanning Trees.


    [1]: Chapter 12 (Sections 12.1 [with exercise 26 on forest], and 12.2 [Theorem 12.2.3 without proof]).

    Week 9 and 10: Minimum Spanning Tree Algorithms: Kruskal’s algorithm, Prim’s algorithm (without
    proofs), Acyclic digraphs and Bellman’s algorithm.
    [1]: Chapter 12 (Sections 12.3, and 12.4 [Proposition 12.4.5, and corollary 12.4.6 without proofs]).

    Week 11: Planar graphs, Euler’s formula, Kuratowski theorem.


    [1]: Chapter 13 (Section 13.1).

    Week 12: Graph coloring, Applications of graph coloring.


    [1]: Chapter 13 (Section 13.2 [Theorem 13.2.4 without proof]).

    Week 13: Circuit testing and facilities design.


    [1]: Chapter 13 (Section 13.3).

    Week 14 and 15: Flows and cuts, Max flow-min cut theorem, Matchings, Hall’s theorem.
    [1]: Chapter 14 (Sections 14.1, 14.2, and 14.4).

    Essential Reading
    1. Goodaire, Edgar G., & Parmenter, Michael M. (2011). Discrete Mathematics with Graph Theory
    (3rd ed.). Pearson Education Pvt. Ltd. Indian Reprint.

    Page | 7
    Department of Mathematics, University of Delhi

    Teaching Plan: B.A. /B.Sc. (Prog.) with Mathematics,


    and B.Sc. (Physical Sc./Mathematical Sc.), Semester-4
    Discipline A-4: Abstract Algebra
    Weeks 1 and 2: Modular arithmetic; Definition and examples of groups, Elementary properties of
    groups.
    [1]: Chapter 0 (up to page 7, and Exercises 3, 7, 9 and 11).
    [1]: Chapter 2.

    Weeks 3 and 4: Order of a group and order of an element of a group; Subgroups and its
    examples, Subgroup tests; Center of a group and centralizer of an element of a group.
    [1]: Chapter 3.

    Week 5: Cyclic groups and its properties, Generators of a cyclic group.


    [1]: Chapter 4 (up to page 80).

    Weeks 6 and 7: Group of symmetries; Permutation groups, Cyclic decomposition of permutations


    and its properties, Even and odd permutations and the alternating group.
    [1]: Chapter 1.
    [1]: Chapter 5 (Examples 1 to 9 and illustrations of Theorems 5.1 to 5.7 without proofs).

    Weeks 8 and 9: Cosets and Lagrange’s theorem; Definition and examples of normal subgroups,
    Quotient groups.
    [1]: Chapter 7 (up to Corollary 5, page 143).
    [1]: Chapter 9 (up to Example 11, page 178).

    Week 10: Group homomorphisms and properties.


    [1]: Chapter 10 (up to Example 14, page 202).

    Weeks 11 to 13: Definition, examples and properties of rings, subrings, integral domains, fields,
    Characteristic of a ring.
    [1]: Chapters 12, and 13.

    Weeks 14 and 15: Ideals and factor rings; Ring homomorphisms and properties.
    [1]: Chapter 14 (up to Example 9, page 251).
    [1]: Chapter 15 (Definition and Examples 1 to 7, and properties of ring homomorphisms, up to
    Corollary 2, page 268).

    Essential Reading
    1. Gallian, Joseph. A. (2017). Contemporary Abstract Algebra (9th ed.). Cengage Learning
    India Private Limited, Delhi. Indian Reprint (2021).

    Page | 8

    You might also like