Kim L.

12/05/23

For each v ∈ V either deg(v) = 1 or deg(v) ≥ m, where m is a fixed positive integer, m ≥ 2, and there is a vertex of degree at least m. What is the smallest value possible for n

Let T = (V, E) be a tree where |V | = n. Suppose that for each v ∈ V either deg(v) = 1 or deg(v) ≥ m, where m is a fixed positive integer, m ≥ 2, and there is a vertex of degree at least m. What is... more

Follows • 1

Answers •1

Discrete Math

12/04/23

Discrete Math: Functions

Prove or disprove the following: If f is 1-1 and g is onto, then gof is onto Prove or disprove the following: If gof exists and f inverse, g inverse exist, then (gof)^-1 = f^-1 o g^-1

Follows • 2

Answers •1

Discrete Math

10/10/23