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 ...

Graph polynomials serve as powerful invariants that encode both combinatorial and topological features of graphs drawn on surfaces. Beginning with the classical Tutte polynomial for planar graphs, ...

We are one of the largest and oldest discrete math groups in Canada. Our group has a wide variety of expertise in pure and applied discrete math and combinatorics. Our research themes include ...

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 ...

Random graph theory provides a probabilistic framework for modelling and analysing networks in which connections between entities are assigned according to specified random processes. From its origins ...

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 ...