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 ...
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, ...
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 ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback