On The Eigenvalue Distribution Of Adjacency Matrices For Connected Planar Graphs
This paper describes the previously unknown statistical distribution of adjacency matrix spectra for planar graphs, also known as spatial weights matrices, in terms of the following three readily available eigenvalue properties: extremes, rank orderings, and sums of powers. This distribution is gove...
Main Author: | Griffith Daniel A. |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2015-12-01
|
Series: | Quaestiones Geographicae |
Subjects: | |
Online Access: | https://doi.org/10.1515/quageo-2015-0035 |
Similar Items
-
Characterization of the Minimizing Graph of the Connected Graphs Whose Complements Are Bicyclic
by: Muhammad Javaid
Published: (2017-03-01) -
Minimum eigenvalue of the complement of tricyclic graphs with n-4 pendent vertexes
by: Hongjuan JU, et al.
Published: (2019-12-01) -
On the <i>A<sub>α</sub></i>-Eigenvalues of Signed Graphs
by: Germain Pastén, et al.
Published: (2021-08-01) -
Bounds for Degree-Sum adjacency eigenvalues of a graph in terms of Zagreb indices
by: Sumedha S. Shinde, et al.
Published: (2021-09-01) -
Zeta functions from graphs
by: Simon Davis
Published: (2018-08-01)