Course

M654 - Discrete Mathematics

Course No: 
M654
Credit: 
4
Approval: 
PG-Elective
Syllabus: 

Combinatorics:Counting principles, Generating functions, Recurrence relation, Polya’s enumeration theory, partially ordered sets.Graph Theory:Graphs, Trees, Blocks, Connectivity, Eulerian and Hamiltonian graphs, Planer graphs, Graph colouring.Design Theory: Block Designs, Balanced incomplete block design, Difference sets and Automorphism, Latin squares, Hadamard matrices, Projective planes, Generalized quadrangles.Algorithm:Algorithm, Asymptotic analysis, Complexity hierarchy, NP-complete problems.

Reference Books: 
  1. F. Roberts and B. Tesman: Applied Combinatorics. Pearson Education, 2005.
  2. M. Aigner, A course in Enumeration, Springer.
  3. R. P. Stanley, Enumerative Combinatorics, Cambridge University Press.
  4. F. Harary, Graph Theory, Narosa Publishing House.
  5. G.A. Bondy and U.S.R. Murty: Graph Theory. Springer, 2008.
  6. W. D. Wallis, Introduction to Combinatorial Designs, Chapman & Hall/CRC
  7. D. R. Stinson and D. Stinson, Combinatorial Designs: Construction and Analysis, Springer.
  8. Thomas Cormen, Charles Leiserson, Ronald Rivest: Introduction to Algorithms. PHI, 1998.

Contact us

School of Mathematical Sciences

NISERPO- Bhimpur-PadanpurVia- Jatni, District- Khurda, Odisha, India, PIN- 752050

Tel: +91-674-249-4081

Corporate Site - This is a contributing Drupal Theme
Design by WeebPal.