Back to Search
Start Over
Some Comments about Zero and Non-Zero Eigenvalues from Connected Undirected Planar Graph Adjacency Matrices.
- Source :
- AppliedMath; Dec2023, Vol. 3 Issue 4, p771-798, 28p
- Publication Year :
- 2023
-
Abstract
- Two linear algebra problems implore a solution to them, creating the themes pursued in this paper. The first problem interfaces with graph theory via binary 0-1 adjacency matrices and their Laplacian counterparts. More contemporary spatial statistics/econometrics applications motivate the second problem, which embodies approximating the eigenvalues of massively large versions of these two aforementioned matrices. The proposed solutions outlined in this paper essentially are a reformulated multiple linear regression analysis for the first problem and a matrix inertia refinement adapted to existing work for the second problem. [ABSTRACT FROM AUTHOR]
- Subjects :
- ZERO (The number)
EIGENVALUES
ECONOMETRICS
PLANAR graphs
LAPLACIAN matrices
Subjects
Details
- Language :
- English
- ISSN :
- 26739909
- Volume :
- 3
- Issue :
- 4
- Database :
- Complementary Index
- Journal :
- AppliedMath
- Publication Type :
- Academic Journal
- Accession number :
- 174401071
- Full Text :
- https://doi.org/10.3390/appliedmath3040042