The minimum number of multiplicity 1 eigenvalues among real symmetric matrices whose graph is a nonlinear tree
In the study of eigenvalues, multiplicities, and graphs, the minimum number of multiplicities equal to 1 in a real symmetric matrix with graph G, U(G), is an important constraint on the possible multiplicity lists among matrices in 𝒮(G). Of course, the structure of G must determine U(G), but, even f...
Main Authors: | Ding Wenxuan, Johnson Charles R. |
---|---|
Format: | Article |
Language: | English |
Published: |
De Gruyter
2021-12-01
|
Series: | Special Matrices |
Subjects: | |
Online Access: | https://doi.org/10.1515/spma-2021-0158 |
Similar Items
-
Least eigenvalue of the connected graphs whose complements are cacti
by: Wang Haiying, et al.
Published: (2019-11-01) -
The classification of edges and the change in multiplicity of an eigenvalue of a real symmetric matrix resulting from the change in an edge value
by: Toyonaga Kenji, et al.
Published: (2017-01-01) -
On minimum algebraic connectivity of graphs whose complements are bicyclic
by: Liu Jia-Bao, et al.
Published: (2019-12-01) -
The location of classified edges due to the change in the geometric multiplicity of an eigenvalue in a tree
by: Toyonaga Kenji
Published: (2019-12-01) -
Corrigendum to “Achievable Multiplicity partitions in the Inverse Eigenvalue Problem of a graph” [Spec. Matrices 2019; 7:276-290.]
by: Adm Mohammad, et al.
Published: (2020-11-01)