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

Authors:
A. Kaveh;B. Alinejad
Affiliations:
Centre of Excellence for Fundamental Studies in Structural Engineering, Iran University of Science and Technology, Narmak, Tehran 16, Iran;Centre of Excellence for Fundamental Studies in Structural Engineering, Iran University of Science and Technology, Narmak, Tehran 16, Iran
Venue:
Finite Elements in Analysis and Design
Year:
2009

Citing 3
Cited 0

Partitioning sparse matrices with eigenvectors of graphs

SIAM Journal on Matrix Analysis and Applications
A multi-level finite element nodal ordering using algebraic graph theory

Finite Elements in Analysis and Design
A new spectral method for nodal ordering of regular space structures

Finite Elements in Analysis and Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.