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

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

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

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

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

The study of geodetic numbers in graph theory represents a compelling fusion of abstract mathematical ideas with practical applications across network analysis, computational optimisation, and ...

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

At 21, Ashwin Sah has produced a body of work that senior mathematicians say is nearly unprecedented for a college student. The proof joined a long list of mathematical results that Sah, who turned 21 ...