Sketch each of the following: i. The graph defined by V = {a, b, c, d, e, f, g} and

E = {{a, c}, {a, d}, {a, g}, {b, a}, {b, f}, {c, d}, {d, f}, {d, g}, {e, f}}

ii. A graph with degree sequence (4, 2, 2, 1, 1)

iii. Two non-isomorphic trees with 7 edges and 6 vertices.

iv. Two non-isomorphic graphs with degree sequence (3, 3, 3, 3, 2, 2, 2, 2)

v. A graph that is not connected and has a cycle.

vi. A bipartitie graph where every vertex has degree 5.

vii. A complete bipartite graph with at least 5 vertices.

viii. A graph that proves that in a group of 8 people it is possible for everyone to be friends

with exactly 4 people.

ix. A graph with chromatic number 4 and 5 vertices.

x. A graph with 6 vertices and with K4 as a subgraph.
Need help fast