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 ...
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 ...
The zeta function of a graph, inspired by analogues in number theory and differential geometry, encodes fundamental cycle and path data in a compact analytic form. Its prototypical instance, the Ihara ...
Graph colouring, the assignment of colours to the vertices of a graph so that no two adjacent vertices share the same colour, represents a canonical NP-hard combinatorial optimisation problem with ...
1 Apply the basic principles of mathematical logic. 2 Construct and analyse mathematical proofs. 3 Apply the principles of set theory, functions and relations. 4 Apply the principles of abstract ...
Recognise two graphs as being isomorphic if there is a one-to-one relationship between the vertices of the two graphs based on, for instance, vertex degrees and adjacency matrices State the ...
Join one of the most vibrant and forward-looking graduate Mathematics programs in Canada. Mathematics is a vital human endeavour that has important outcomes and applications in almost any field. The ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results