MAT 534 DISCRETE MATHEMATICS (3 CREDITS) This course is an introductory to Discrete covering such topics as Relations, Digraphs, Letice,

Boolean Algebra, Basic Concepts of Graph Theory, and Applications of Graph Theory References Deo,N. (1989). Graph Theory with Applications to Engineering and Computer Science. New Delhi : Prientice-Hall Kolman, B & Busby, R.C. (1987). Discrete Mathematical Structures for Computer Science. New Jerser : Prientice-Hill Trembley, J.P., & Monahar, R. (1988). Discrete Mathematical Stuctures with Applications to computer Sciense. New York : McGraw-Hill Book Company Wiitala, S.A. (1987). Discrete Mathematics A Unified Approach. New York : McGraw-Hill Book Company Table of Course Activities Week I II III IV V VI VII Number of Activities 1 2 3 4 5 6 7 8 9 10 11 12 13 14 VIII 15 16 IX 17 18 Topics Relation, Paths in Relation and Digraphs Properties of Relations Computer Repsetantion of Relation and Digraph Manipulation of Relations Partially Ordered Set (Poset) Properties of lattices External Elements of Partially Ordered Set Lattices Hasse Diagram of Lattices Properties of Lattices Finite Boolean Algebras Properties of Boolean Algebra Function on Boolean Algebra Minimation of Function on Boolean Algebra Basic Concepts of Graph Theory Isomorphism, subgraph, walks, paths, and circuits Connected graphs, disconnected graphs, and components Euleur graphs, Hamiltonian paths and circuits

X XI XII XIII XIV

19 20 21 22 23 24 25 26 27 28

Trees and their properties Spanning trees and fundamental circuits Cut-sets and cut-vertices Connectivity and separability Planar graphs and their repsentations Properties of planar graphs Incidence matrix Properties of incidence matrix Adjacency matrix Properties of adjacency matrix

Sumber Bahan (Rujukan) Abdul Kadir, 1999, Pemrograman PASCAL, Andi Offest, Yogyakarta J.P. Lamoitier, 1981, Fifty BASIC Exercises, Sybex, USA Jogiyanto. H.M, 1994, PASCAL Tingkat Lanjutan, Andi Offest, Yogyakarta