Linear Algebra in Geography: Eigenvectors of Networks
From MaRDI portal
Cited in
(6)- Graph Coloring Using Eigenvalue Decomposition
- A new algorithm for finding a pseudoperipheral vertex or the endpoints of a pseudodiameter in a graph
- Finite element mesh decomposition using complementary Laplacian matrix
- Complex adjacency spectra of digraphs
- Spectral geometry and Riemannian manifold mesh approximations: some autocorrelation lessons from spatial statistics
- Combinatorial optimization of special graphs for nodal ordering and graph partitioning
This page was built for publication: Linear Algebra in Geography: Eigenvectors of Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3895590)