1. Represent each of the following graphs with an adjacency matrix. (a). K5 (b).

ID: 2966302 • Letter: 1

Question

1. Represent each of the following graphs with an adjacency matrix.

(a). K5

(b). K2;3

(c). The email graph from the M07 homework, in which each edge presents a directed, weighted edge.

For convenience, that graph is described here: In a company, emails sent from one employee to another

are tracked as follows: Mr. Cooper sends 3 emails to Mrs. Sanders. Mrs. Sanders sends 4 emails to

Ms. Bighton, Ms. Bighton send 1 email to Mr. Ortega and Mr. Ortega does not send anyone any

emails. Furthermore, Mrs. Sanders sends Mr. Cooper 3 emails, Mrs. Bighton sends Mr. Cooper 2

emails.

1. K5 is a complete graph with 5 vertices :

0 1 1 1 1

1 0 1 1 1

1 1 0 1 1

1 1 1 0 1

1 1 1 1 0

2. K 2,3 graph

assume vertices 1 and 2 is connected to 3,4,5 (no connections between (1,2)(3,4)(3,5)(4,5) )

0 0 1 1 1

1 1 0 0 0

Cooper Sanders Bighton Ortega Cooper 0 3 0 0 Sanders 3 0 4 0 Bighton 2 0 0 1 Ortega 0 0 0 0

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.