Factorization for efficient solution of eigenproblems of adjacency and Laplacian matrices for graph products (Q3590357)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5787550
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Factorization for efficient solution of eigenproblems of adjacency and Laplacian matrices for graph products |
scientific article; zbMATH DE number 5787550 |
Statements
Factorization for efficient solution of eigenproblems of adjacency and Laplacian matrices for graph products (English)
0 references
17 September 2010
0 references
adjacency
0 references
Laplacian
0 references
Cartesian product
0 references
strong Cartesian product
0 references
direct product
0 references
lexi-cographic product
0 references
factorization
0 references
irregular graphs
0 references
0 references
0.8854548931121826
0 references
0.8353801369667053
0 references
0.8317245244979858
0 references
0.8242062330245972
0 references
0.8058480620384216
0 references
