X hits on this document

143 views

0 shares

0 downloads

0 comments

2 / 32

algorithms for minimal spanning tree, The Max flow –Min cut theorem (transport network).                                     (8)

Unit VI

Groups and Rings

Algebraic Systems, Groups, Semi Groups, Monoid, Subgroups, Permutation Groups, Codes and Group codes, Isomorphism and Automorphisms, Homomorphism and Normal Subgroups, Ring, Integral Domain, Field, Ring Homomorphism, Polynomial Rings and Cyclic Codes   (8)

Text Books:

1.

C. LIU, “Elements of Discrete Mathematics”, 2nd Edition, Tata McGraw-Hill, 2002, ISBN 0-07-043476-X.

2.

R. Johnsonbaugh, “Discrete Mathematics”, 5th Edition, Pearson Education, 2001 ISBN 81 – 7808 – 279 - 9 (Recommended for Unit I and Unit II)

Reference Books:

1.

N. Biggs, “Discrete Mathematics”, 2nd Edition, Oxford, 2002 ISBN 0 –19 – 850717 - 8

2.

E. Goodaire, M. Parmenter, “Discrete Mathematics with Graph Theory”, 2nd edition, Pearson Education, 2003 ISBN 81 – 7808 – 827 – 4 (Recommended for Recurrence relations).

3.

N. Deo, “Graph theory with application to Engineering and Computer Science”, Prentice Hall of India, 1990, 0 – 87692 – 145 – 4 (Recommended for Graph)

4.

B. Kolman, R. Busby and S. Ross, “Discrete Mathematical Structures”, 4th Edition, Pearson   Education, 2002, ISBN 81-7808-556-9

5.

J. Tremblay, R. Manohar, “Discrete Mathematical Structures with application to Computer Science”, Tata McGraw-Hill, 2002 ISBN 0-07-463113-6 (Recommended for prepositional Calculus)

6.

F. Harary, “Graph Theory”, Narosa Publishing House, 1988 ISBN 81 – 85015 – 55 – 4

Document info
Document views143
Page views148
Page last viewedThu Jan 19 19:52:34 UTC 2017
Pages32
Paragraphs1002
Words9463

Comments