graph colouring and Brooks' Theorem; spectral graph theory and random walks. 20 hours of lectures and 10 hours of seminars in the MT. 4 hours of lectures and 1 hour of seminars in the ST. Norman L.

In discrete mathematics, they are structures ... This approach facilitates the comparison across a large pool of graphs.

This course will discuss fundamental concepts and tools in discrete mathematics with emphasis on their applications ... trees and more general graphs. DETAILED COURSE TOPICS: All sections will deal ...