This answer is restricted. Please login to view the answer of this question.

Login Now**Eular Path:**

A simple path in a graph G that passes through every edge once and only once is called eular path. An euler circuit is an Eular path that returns to its starting vertex.

A connected multigraph has an Eular path but not an euler circuit if and only if it has at most (max) two vertices of odd degree.

a → c → d → e → b → d → a → b

Here, it passes throughall edges only once. No edge is repeated

**Hamilton Path:**

A simple path in a graph G that passes through every vertex exactly once is called a hamilton path.

a, b, c d or a, b, d, c

Here, it passes through every vertices and no vertices is repeacted. So, it is hamilton path.

**Diagram Part:**

Given set, {1, 2, 5, 8, 16, 32}

According to the given question, we have to find the poset for the divisibility.

Let, the set is A

A = {(1, 2), (1, 5), (1, 8), (1, 16), (1, 32), (2, 8), (2, 16), (2, 32), (8, 16), (8, 32), (16, 32)}

So, now the hasse diagram will be

Here,

Maximum = 5, 32

Greatest = Do not exists

Minimum = 1

Least = 1

If you found any type of error on the answer then please mention on the comment or report an answer or submit your new answer.

Click here to submit your answer.

HAMROCSIT.COM

## Discussion