I really need help about the following problem from matrices and graphs.

Having graph with connections as on following image,
how can an adjacency matrix element be given in general form, regarding dimensions n and m, how to number vertices appropriately?
After that how to get transitive closure of graph and it's element form given above, according to dimensions n x m, and prove it?

Thanks in advance