The minimum number of multiplicity 1 eigenvalues among real symmetric matrices whose graph is a nonlinear tree
Ding Wenxuan, Johnson Charles R.
Special Matrices · 2021
doi:10.1515/spma-2021-0158 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
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 for trees, this linkage has proven elusive. If T is a tree, U(T) is at least 2, but may be much greater. For linear trees, recent work has improved our understanding. Here, we consider nonlinear trees, segregated by diameter. This leads to a new combinatorial construct called a core, for which we are able to calculate U(T). We suspect this bounds U(T) for all nonlinear trees with the given core. In the process, we develop considerable combinatorial information about cores.
Abstract licence: CC BY
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.