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 ...
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, ...
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 ...
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 ...
1 Apply the basic principles of mathematical logic. 2 Construct and analyse mathematical proofs. 3 Apply the principles of set theory, functions and relations. 4 Apply the principles of abstract ...
MacDonald, Lori, Paul S. Wenger, and Scott Wright. "Total Acquisition on Grids." The Australasian Journal of Combinatorics 58. 1 (2014): 137-156. Web. * Wenger, Paul S. "A Note on the Saturation ...
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 games represent a vibrant area of combinatorial game theory wherein two opponents engage in a strategic contest on the vertices of a graph. In the standard format, one player, known ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback