Computational Combinatorics(CMA702)

Course Name: 

Computational Combinatorics

Programme: 

M.Tech (CMA)

Semester: 

First

Category: 

Programme Core (PC)

Credits (L-T-P): 

(3-0-0)3

Content: 

Combinatorics: Generating Permutations and Combinations, Relations, Recurrence Relations and Generating Functions. Lattice Theory: Lattices and their properties, Duality Principle, New Lattices – Lattice Homomorphisms, Product Lattices, Modular and Distributive Lattices, Boolean Algebras/ Boolean Lattices, Boolean Polynomial. Graph Theory: Different classes of graphs, Digraphs and their fundamental properties, Representations of graphs, Trees, Connectivity, Traversability, Planarity and Colorability.

References: 

Ralph P. Grimaldi, Discrete and Combinatorial Mathematics – An applied introduction, Pearson Addison Wesley, 5th Edition, 2004.
Richard A. Brualdi, Introductory Combinatorics, China Machine Press, 5th Edition, 2009.
J. P. Tremblay and R. Manohar, Discrete Mathematical Structures with applications to Computer Science, McGraw Hill
Jonathan L. Gross and Jay Yellen, Handbook of Graph Theory, CRC Press.
Geir Agnarsson and Raymond Greenlaw, Graph Theory – Modeling, Applications and Algorithms, Pearson Education, 2007

Department: 

Mathematical and Computational Sciences
 

Contact us

B R Shankar, Associate Professor and Head
Department of MACS, NITK, Surathkal
P. O. Srinivasnagar, Mangalore - 575 025
Karnataka, India.

  • Hot line: +91-0824-2474048

Connect with us

We're on Social Networks. Follow us & get in touch.