1. 2. Let A = {1, 2, 3, 4, 5} Determine the Hasse diagram for below...

 

Transcribed Image Text:

1. 2. Let A = {1, 2, 3, 4, 5} Determine the Hasse diagram for below matrix. Identify Maximal, Minimal, Greatest and Least elements. -1 1 1 1 0 1 1 1 0 1 1 1 0 0 0 1 0 -0 0 00 1 0100 For the following, each relation R is defined on the set A. Determine if R is a tree, if it is, find the root. A = (a, b, c, d, e, f}; R = {(a, b), (c, e), (f, a), (f, c), (f, d)} 3. 4. Find the minimal spanning tree for the following weighted graph using Kruskal (starts at E) approaches: B 3 A For the following graph; 2 4 D 2 C 5 2 E 4 5 C F H 4 i) Give the set of vertices (V), the set of edges (E) and the degree of each vertex ii) identify whether it contains an Euler circuit and/or an Euler path. If exist, state the path: 1. 2. Let A = {1, 2, 3, 4, 5} Determine the Hasse diagram for below matrix. Identify Maximal, Minimal, Greatest and Least elements. -1 1 1 1 0 1 1 1 0 1 1 1 0 0 0 1 0 -0 0 00 1 0100 For the following, each relation R is defined on the set A. Determine if R is a tree, if it is, find the root. A = (a, b, c, d, e, f}; R = {(a, b), (c, e), (f, a), (f, c), (f, d)} 3. 4. Find the minimal spanning tree for the following weighted graph using Kruskal (starts at E) approaches: B 3 A For the following graph; 2 4 D 2 C 5 2 E 4 5 C F H 4 i) Give the set of vertices (V), the set of edges (E) and the degree of each vertex ii) identify whether it contains an Euler circuit and/or an Euler path. If exist, state the path: