a. Only a Hamiltonian path
One such path is
1 → 2 → 0 → 4 → 3
which satisfies the requirement that each vertex is visited exactly once.
There is no Hamiltonian circuit, however, since it is impossible for any Hamiltonian path on this graph to visit vertex 0 exactly once.
Answer:
105
Step-by-step explanation:
Let the angle of B be x
According to the question,
5x+x=90
or, 6x=90
or, x=15
The angle of B is 15
The angle of A is (15*5)=75
The supplementary angle of A is
(180-75)=105
Answer:
Step-by-step explanation:
(x-3)/(x+4) = x/(x+10)
(x-3)(x+10) = x(x+4)
x²+7x-30 = x²+4x
3x = 30
x = 10
