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 ...
This course is available on the MSc in Applicable Mathematics. This course is available as an outside option to students on other programmes where regulations permit. Students should be taking 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 ...
Anti-Ramsey theory in graphs is a branch of combinatorial mathematics that examines the conditions under which a graph, when its edges are coloured, must necessarily contain a ‘rainbow’ subgraph – a ...
SEPARATION OF CARTESIAN PRODUCTS OF GRAPHS INTO SEVERAL CONNECTED COMPONENTS BY THE REMOVAL OF EDGES
Let G = (V(G), E(G)) be a graph. A set S ⊆ E(G) is an edge k-cut in G if the graph G − S = (V(G), E(G) \ S) has at least k connected components. The generalized k-edge connectivity of a graph G, ...
The so-called differential equation method in probabilistic combinatorics presented by Patrick Bennett, Ph.D., Department of Mathematics, Western Michigan University Abstract: Differential equations ...
Deep in the heart of Microsoft, Jennifer Chayes and Christian Borgs lead a who's who of mathematics and computer science. The goal? To explore anything they please Every weekday afternoon some 20 ...
Taiwanese Journal of Mathematics, Vol. 6, No. 3 (September 2002), pp. 415-420 (6 pages) In a graph G, a vertex is said to dominate itself and all of its neighbors. For a fixed positive integer k, the ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback