Discrete Mathematics with Graph Theory (3rd Edition) 304

# Discrete Mathematics with Graph Theory (3rd Edition) 304 -...

This preview shows page 1. Sign up to view the full content.

302 Solutions to Exercises (c) p= [H ~ H o 100 0 00010 (d) The digraphs are not strongly connected; in 91. for instance, there is no path from Vs to V4 which respects directions and 92, being isomorphic to 91 cannot be strongly connected either. (e) The digraphs are not Eulerian because they are not strongly connected. (In addition, there are vertices whose indegree differs from their outdegree;
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: V2 in 91, for example.) 16. (a) The given matrices are the adjacency matrices of the digraphs 91 and 92 shown. The map cp defined by (b) The given matrices are the adjacency matrices of the digraphs 91 and 92 shown. Vl<>V3 U1VU4 V2cOV4 U2VU3 The map cp defined by is an isomorphism 91 ---+ f:h. Thus, A2 = PA 1 P T where...
View Full Document

## This note was uploaded on 11/08/2010 for the course MATH discrete m taught by Professor Any during the Summer '10 term at FSU.

Ask a homework question - tutors are online