×

Eigenvalues of the adjacency and Laplacian matrices for modified regular structural models. (English) Zbl 1207.05119

Summary: The graph model of many space structures and finite element models can be formed using graph products. These structures are known as regular structures. Methods for calculating the eigenvalues of the matrices corresponding to these models are already investigated. In practice for some structural models the addition of some nodes and members to the graph product is required. When such a node and the incident members are added to a regular model, it becomes a modified regular structure. In this paper the eigenproblem of the matrices corresponding to these models is studied. The necessary formulations are derived and examples are presented to illustrate the practical value of the presented approach.

MSC:

05C50 Graphs and linear algebra (matrices, eigenvalues, etc.)
05C76 Graph operations (line graphs, products, etc.)
Full Text: DOI

References:

[1] Kaveh, Structural Mechanics: Graph and Matrix Methods (2004)
[2] Kaveh, Optimal Structural Analysis (2006) · doi:10.1002/9780470033326
[3] Biggs, Algebraic Graph Theory (1993) · Zbl 0284.05101
[4] Cvetković, Spectra of Graphs, Theory and Applications (1980)
[5] Godsil, Algebraic Graph Theory (2001) · doi:10.1007/978-1-4613-0163-9
[6] Fiedler, Algebraic connectivity of graphs, Czechoslovak Mathematical Journal 23 pp 298– (1973) · Zbl 0265.05119
[7] Mohar, Graph Theory, Combinatorics and Applications 2 pp 871– (1991)
[8] Pothen, Partitioning sparse matrices with eigenvectors of graphs, SIAM Journal on Matrix Analysis and Applications 11 pp 430– (1990) · Zbl 0711.65034
[9] Kaveh, Eigensolutions for matrices of special structures, Communications in Numerical Methods in Engineering 9 pp 125– (2003) · Zbl 1013.65030
[10] Kaveh, Eigensolutions for factorable matrices of special patterns, Communications in Numerical Methods in Engineering 20 (2) pp 133– (2004) · Zbl 1038.65032
[11] Kaveh, Augmented canonical forms and factorization of graphs, International Journal for Numerical Methods in Engineering 65 (10) pp 1545– (2006) · Zbl 1116.05067
[12] Imrich, Product Graphs, Structure and Recognition (2000)
[13] Kaveh, A new spectral method for nodal ordering of regular space structures, Finite Elements in Analysis and Design 40 (13/14) pp 1931– (2004)
[14] Kaveh, An efficient method for decomposition of regular structures using graph products, International Journal for Numerical Methods in Engineering 61 pp 1797– (2004) · Zbl 1075.74539
[15] Kaveh, A unified method for eigendecomposition of graph products, Communications in Numerical Methods in Engineering 21 (7) pp 377– (2005) · Zbl 1066.05087
[16] Kaveh, Block diagonalization of adjacency and Laplacian matrices for graph products; applications in structural mechanics, International Journal for Numerical Methods in Engineering 68 (1) pp 33– (2006) · Zbl 1127.74050
[17] Kaveh, Unification of three canonical forms with application to stability analysis, Asian Journal of Civil Engineering 6 (2) pp 112– (2006)
[18] Kaveh, Tri-diagonal and penta-diagonal block matrices for efficient eigensolutions of problems in structural mechanics, Acta Mechanica 192 (1-4) pp 77– (2007) · Zbl 1120.74024
[19] Kaveh, Compound matrix block diagonalization for efficient solution of eigenproblems in structural mechanics, Acta Mechanica 188 (3-4) pp 155– (2007) · Zbl 1107.74024
[20] Kaveh, Factorization for efficient solution of eigenproblems of adjacency and Laplacian matrices for graph products, International Journal for Numerical Methods in Engineering 75 (1) pp 58– (2008) · Zbl 1195.74073
[21] Sabidussi, Graph multiplication, Mathematische Zeitschript 72 pp 446– (1960) · Zbl 0093.37603
[22] Horn, Matrix Analysis (1990)
[23] Penney, Linear Algebra: Ideas and Applications (2008)
[24] Pothen, Partitioning sparse matrices with eigenvectors of graphs, SIAM Journal on Matrix Analysis and Applications 11 pp 430– (1990) · Zbl 0711.65034
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.