A general theorem for adjacency matrices of graph products and application in graph partitioning for parallel computing

Many regular models can be viewed as the graph products of two ore more subgraphs know as their generators. In this paper, a general theorem is presented for the formation of adjacency matrices using a series of algebraic relationships. These operations are performed on the adjacency matrices of the generators. The Laplacian matrix of the graph product is then formed and the second eigenvalue and the corresponding eigenvector are used for the bisection of the regular graphs associated with space structures or finite element models.