A unified method for eigendecomposition of graph products

MaRDI QIDQ3080298zbMATH OpenFDO

Authors A. Kaveh, Hossein Rahami

Publication date 10 March 2011

zbMATH Keywords

adjacencyCartesian productdirect producteigendecompositiongraph productLaplacianregular graphstrong Cartesian product

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph operations (line graphs, products, etc.) (05C76) Applications of graph theory (05C90)

Recommendations

• A unified method for eigendecomposition of graph products
• Factorization for efficient solution of eigenproblems of adjacency and Laplacian matrices for graph products
• Block diagonalization of adjacency and Laplacian matrices for graph product; applications in structural mechanics
• Eigensolution of Laplacian matrices for graph partitioning and domain decomposition: approximate algebraic method
• Laplacian matrices of product graphs: applications in structural mechanics

Cited in

(6)

• Estimation of Laplacian spectra of direct and strong product graphs
• Factorization for efficient solution of eigenproblems of adjacency and Laplacian matrices for graph products
• Laplacian matrices of product graphs: applications in structural mechanics
• Eigensolution of Laplacian matrices for graph partitioning and domain decomposition: approximate algebraic method
• Block diagonalization of adjacency and Laplacian matrices for graph product; applications in structural mechanics
• A unified method for eigendecomposition of graph products

This page was built for publication: A unified method for eigendecomposition of graph products

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3080298)