Answer:
n≤−2 or A
Step-by-step explanation:
because i know
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.
A. x=34
2 x 17 = 34
34/2 = 17
35.53 is the answer I hoped that helped
Answer:
<h2>The answer is 58 m</h2>
Step-by-step explanation:
Perimeter of a rectangle = 2l + 2w
where
l is the length
w is the width
From the question
length = 17 m
width = 12 m
Substitute the values into the above formula and solve for the perimeter
We have
Perimeter = 2(17) + 2(12)
= 34 + 24
We have the final answer as
<h3>58 m</h3>
Hope this helps you
