6.4.43 Graph theory

Condition: The Orgraph is set by the Matrix of Advance. Necessary: a) draw a graph; b) highlight the components of strong connectedness; c) replace all the arcs with ribs and in the obtained non -oriented column to find a chain (or cycle) to Eulerov. \[ \left(\begin{array}{llllll} 1 & 0 & 1 & 0 & 0 & 0 \\ 0 & 0 & 0 & 1 & 0 & 0 \\ 1 & 0 & 1 & 0 & 1 & 0 \\ 0 & 1 & 0 & 1 & 1 & 0 \\ 0 & 0 & 0 & 1 & 0 & 0 \\ 1 & 0 & 0 & 1 & 1 \ End {Array} \ Right). \]