Question 8 (20 marks) denote by x(g) the chromatic mumber of a graph g (a) let g be a graph with no 3-cycle. let ei and e2 be two distinct edges of g with a common end-vertex. let h = g - (e1,e2} be the spanning subgraph of g obtained from g by deleting e and e2. prove that x(g)-1x(h) x(g). (b) suppose that g is a graph and v is a cut-vertex of g. prove that there exist subgraphs gi and g2 of g such that g giug2, v(g)n v(g2) = {v} and max{x(gi), x(g2)}. x(g)

10a^3+277a^2-132a-792

step-by-step explanation:

(2a+11)(5a-12)(foil)

=10a^2-24a+55a-132 =10a^2+31a-132

(10a^2+31a-132)(a+6)

=10a^3+60a^2+31a^2+186a^2-132a-792 =10a^3+277a^2-132a-792

i hope this is what you are looking for : )

b. ol

step-by-step explanation:

i got the answer right on edg.

congruent: (geometry) (of figures) identical in form; coinciding exactly when superimposed.

6 cars because if you have 8 and subtract 2 youll have 6 left over

m∠abd = m∠dbc

step-by-step explanation:

given : ab bisects ∠dbc

as we know that bisection means ab divides   ∠dbc   in two equal angles named as   ∠dba and   ∠abc

so, m∠abd = m∠dbc  

because ab bisects ∠dbc.

hence , the first statement m∠abd = m∠dbc is true.