Discrete Mathematics is a subject that has gained prominence in recent times. Unlike regular Maths, where we deal with real numbers that vary continuously, Discrete Mathematics deals with logic that ...
If you are interested in the real-world applications of numbers, discrete mathematics may be the concentration for you. Because discrete mathematics is the language of computing, it complements the ...
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 ...
6monon MSN
Hard in theory, easy in practice: Why graph isomorphism algorithms seem to be so effective
Graphs are everywhere. In discrete mathematics, they are structures that show the connections between points, much like a ...
This course is available on the MSc in Applicable Mathematics and MSc in Operations Research & Analytics. This course is available as an outside option to students on other programmes where ...
P. Horak, L. Stacho eds., Special issue of Discrete Mathematics: Combinatorics 2006, A meeting in celebration of Pavol Hell’s 60th birthday, Vol. 309, 2009. D. Kral ...
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, ...
Graph Domination Theory is a fundamental area in combinatorial optimisation and theoretical computer science that examines dominating sets and their diverse extensions. At its core, a dominating set ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback