Answer: 1 .Thus for a graph to have an Euler circuit, all vertices must have even degree. The converse is also true: if all the vertices of a graph have even degree, then the graph has an Euler circuit, and if there are exactly two vertices with odd degree, the graph has an Euler path.
2. A graph has an Euler circuit if and only if the degree of every vertex is even. A graph has an Euler path if and only if there are at most two vertices with odd degree.
Step-by-step explanation:
Can i have branily plz
First you must know that is i∧2= -1
x∧3-4x∧2+4x-16 = x∧2 (x-4) + 4 (x-4) = (x-4) (x∧2+4) = (x-4) (x∧2-(-4)) =
= (x-4) (x∧2-(-1) *4) = (x-4) (x∧2- i∧2*2∧2) = (x-4) (x∧2-(2i)∧2) = (x-4) (x-2i) (x+2i)
Good luck!!!
We have to add 4 3/4 to 1/3 and the answer will be 4 4/7
