A unified method for eigendecomposition of graph products
โ Scribed by Kaveh, A. ;Rahami, H.
- Publisher
- John Wiley and Sons
- Year
- 2005
- Tongue
- English
- Weight
- 129 KB
- Volume
- 21
- Category
- Article
- ISSN
- 1069-8299
- DOI
- 10.1002/cnm.753
No coin nor oath required. For personal study only.
โฆ Synopsis
Abstract
In this paper, a unified method is developed for calculating the eigenvalues of the weighted adjacency and Laplacian matrices of three different graph products. These products have many applications in computational mechanics, such as ordering, graph partitioning, and subdomaining of finite element models. Copyright ยฉ 2005 John Wiley & Sons, Ltd.
๐ SIMILAR VOLUMES
Wilbrink and Brouwer [18] proved that certain semi-partial geometries with some weak restrictions on parameters satisfy the dual of Pasch's axiom. Inspired by their work, a class of incidence structures associated with distance-regular graphs with classical parameters is studied in this paper. As a