Let g be a simple n-vertex graph. suppose that the sum of the degrees of any k vertices of g is less than or equal to n-k. prove that every maximal independent set in g has more than k vertices. (hint, address two cases. one is if the size of the independent set is equal to n-k).

your answer would be b

step-by-step explanation:

step-by-step explanation:

we have

using a graphing tool

see the attached figure

this is a quadratic equation (vertical parabola) open up

the vertex is a > vertex

the domain of the function is all real > interval (-∞,∞)

the range of the function is the > [-6.125,∞)

the function has two x->   and

the function is increasing over the > (0.25,∞)

the function is decreasing over the > (-∞,0.25)

the answer is

d.

5.3066 m2

step-by-step explanation: