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

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

Discrete math focuses on studying finite objects. It is an exciting area that has many connections to computer science, algebra, optimization, representation theory, and algebraic geometry. Our ...

A bundle is a package of resources grouped together to teach a particular topic, or a series of lessons, in one place. These PowerPoints form full lessons of work that together cover the new AS level ...

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

Total colouring addresses the problem of assigning colours simultaneously to the vertices and edges of a graph so that no two adjacent or incident elements share the same colour. Introduced in the ...