A 5 Points Two Graphs G1 V1 E1 And G2 V2 E2 Are Isomorphic If There Is A 1 1 Correspon Dence Function F 1 (146.86 KiB) Viewed 36 times
- a) (5 Points) Two graphs G1 = (V1, E1) and G2 = (V2, E2) are isomorphic if there is a 1-1 correspon- dence function f : V1 + V2 such that (u, v) E Eį if and only if (f(u), f(v)) E E2. Determine whether the following two graphs are isomorphic. Note that vertices are illustrated as red dots. (a) (b) )
b) (5 Points) A set of edges E is called an edge cut of a graph G if the subgraph G-E is disconnected. The edge connectivity of a graph is the minimum number of edges in an edge cut. Determine the edge connectivity of the following graphs. i) Figure I. ii) Figure II. c) (5 Points) A set of vertices V is called a cut of a graph G if the subgraph G - V is disconnected. The connectivity of a graph is the minimum number of vectices in a cut. Determine the connectivity of the following graphs. i) Figure I. ii) Figure II. (a) Figure I (b) Figure II d) (5 Points) Draw a simple undirected graph containing 6 vertices with 1 vertex of degree 2, 2 vertices of degree 3, and 3 vertices of degree 4.
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!