This preview shows page 1. Sign up to view the full content.
Unformatted text preview: cp, its adjacency matrix becomes that of 92. [ ~ 1 0 n (c) [BB] P = o 0 o 0 0 1 (d) [BB] The digraphs are strongly connected: In 91, for instance, VI V2V3 V4 VI is a circuit which respects arrows and 92 is isomorphic to 91 hence, also strongly connected. (e) [BB] The digraphs are not Eulerian. In 910 for instance, vertex V2 has indegree 2 but outdegree 1. 15. (a) Al = [H ~ H 1 0 1 0 1 1 1 1 0 0 and A 2 = [~ H H o 1 000 1 1 1 0 0 (b) With the vertices of 91 relabeled according to cp, the adjacency matrix of 91 becomes that of 92. ...
View
Full
Document
 Summer '10
 any
 Graph Theory, Matrices

Click to edit the document details