An efficient method for decomposition of regular structures using graph products | Zendy

Kaveh A. | Zendy; Rahami H. | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Premium

An efficient method for decomposition of regular structures using graph products

Author(s) -

Kaveh A.,

Rahami H.

Publication year - 2004

Publication title -

international journal for numerical methods in engineering

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 1.421

H-Index - 168

eISSN - 1097-0207

pISSN - 0029-5981

DOI - 10.1002/nme.1126

Subject(s) - eigenvalues and eigenvectors , adjacency matrix , cartesian product , simple (philosophy) , mathematics , laplacian matrix , adjacency list , graph , spectral graph theory , laplace operator , discrete mathematics , combinatorics , voltage graph , line graph , mathematical analysis , philosophy , physics , epistemology , quantum mechanics

In this paper an efficient method is presented for calculating the eigenvalues of regular structural models. A structural model is called regular if they can be viewed as the direct or strong Cartesian product of some simple graphs known as their generators . The eigenvalues of the adjacency and Laplacian matrices for a regular graph model are easily obtained by the evaluation of eigenvalues of its generators. The second eigenvalue of the Laplacian of a graph is also obtained using a much faster and much simple approach than the existing methods. Copyright © 2004 John Wiley & Sons, Ltd.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here

Accelerating Research