Discrete mathematics is the study of finite or countable discrete structures; it spans such topics as graph theory, coding theory, design theory, and enumeration. The faculty at Michigan Tech ...

This course will discuss fundamental concepts and tools in discrete mathematics with emphasis on their applications to computer science. Example topics include logic and Boolean circuits; sets, ...

Taiwanese Journal of Mathematics, Vol. 14, No. 4 (August 2010), pp. 1537-1542 (6 pages) The domination number γ(G) of a graph G is the minimum cardinality among all dominating sets of G, and the ...

This course is available on the MSc in Applicable Mathematics. This course is available as an outside option to students on other programmes where regulations permit. Students should be taking the ...

Taiwanese Journal of Mathematics, Vol. 13, No. 5 (October 2009), pp. 1397-1410 (14 pages) Let G be a simple undirected graph. Denote by mi(G) (respectively, xi(G)) the number of maximal (respectively, ...

Introduces students to ideas and techniques from discrete mathematics that are widely used in science and engineering. Mathematical definitions and proofs are emphasized. Topics include formal logic ...

In discrete mathematics and combinatorics courses, students learn to master the use and combinations of integers, graphs, sets and logic statements. These are the best graduate schools for discrete ...

Jason Williford joined the University of Wyoming faculty in 2009. He came to the University of Wyoming from the University of Colorado at Denver. His mathematical interests center around the interplay ...