Topic: Discrete Mathematics and its Applications" Chapter 10: Graphs and Graph Models"

1. In a simple graph, define the degree of each vertex as di) -IN(i)], the number neighbors that vertex i is connected to For the following simple graph: 4 6 7 (a) Write the adjacency matrix for the graph. Answer only; no explanation needed. Here is a matrix template to be edited: (b) List the degree of each vertex, as a set of ordered pairs {(i, d(i)) l i E } Answer only; no explanation needed