Analysis of Approximation Methods of Laplacian Eigenvectors of the Kronecker Product of Graphs
This paper analyzes two approximation methods for the Laplacian eigenvectors of the Kronecker product, as recently presented in the literature. We enhance the approximations by comparing the correlation coefficients of the eigenvectors, which indicate how well an arbitrary vector approximates a matr...
Saved in:
| Main Authors: | Marko Miladinović, Milan Bašić, Aleksandar Stamenković |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2025-03-01
|
| Series: | Axioms |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2075-1680/14/3/192 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Graph Sampling Through Graph Decomposition and Reconstruction Based on Kronecker Graphs
by: Shen Lu, et al.
Published: (2022-04-01) -
On Kronecker Product Of Two RL-graphs And Some Related Results
by: Elham Raisi Sarbizhan, et al.
Published: (2022-11-01) -
Laplacian Controllability and Observability of Multi-Agent Systems: Recent Advances in Tree Graphs
by: Gianfranco Parlangeli
Published: (2025-04-01) -
Kronecker product bases and their applications in approximation theory
by: Mohra Zayed, et al.
Published: (2025-02-01) -
On the neighbourhood degree sum-based Laplacian energy of graphs
Published: (2025-01-01)