6.4.34 Graph theory

\ (\ underline {\ mathrm {y} _ {\ text {Sliding:}}} \) according to a given matrix of the adjacency to build a non -oriented graph, compile a table of degrees of vertices, a matrix of incitement, a table of distances and conditional radii, find a radius and the center of the graph. \ [A (G) = \ LEFT (\ Begin {Array} {llllllll} 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1& 0 & 1& 0 & 1& 0 & 1& 0 & 1 & 0 & 0 \\ 1 & 1 & 0 & 0 & 1 & 1 & 0 & 0 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 0 & 1 & 0 & 0 & 1 & 0 & 0 & 1 & 0 & 0 & 0 & 0 & 1 & 1 & 0 \\ 0 & 0 & 0 & 1 & 1 & 1 & 1 \\