Graphs are everywhere. In discrete mathematics, they are structures that show the connections between points, much like a ...

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

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

KALAMAZOO, Mich.—Western Michigan University's international reputation on the topic of graph theory is on display in a new book published recently by Princeton University Press. Graph theory, a ...

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

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

Disclosure: Our goal is to feature products and services that we think you'll find interesting and useful. If you purchase them, Entrepreneur may get a small share of the revenue from the sale from ...