2012
DOI: 10.26493/1855-3974.306.32d
|View full text |Cite
|
Sign up to set email alerts
|

Unordered multiplicity lists of wide double paths

Abstract: Recently, Kim and Shader analyzed the multiplicities of the eigenvalues of a Φ-binary tree. We carry this discussion forward extending their results to a larger family of trees, namely, the wide double path, a tree consisting of two paths that are joined by another path. Some introductory considerations for dumbbell graphs are mentioned regarding the maximum multiplicity of the eigenvalues. Lastly, three research problems are formulated.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(4 citation statements)
references
References 23 publications
0
4
0
Order By: Relevance
“…, where a 1 > a 2 − t and t > 0, then the eigenvalues of matrix D 0 , defined in (6), are equal to a 1 +t, a 1 +t, a 2 −t, a 2 −t and the orthogonal matrix that diagonalizes D 0 is equal to…”
Section: Theorem 31 ([9]mentioning
confidence: 99%
See 1 more Smart Citation
“…, where a 1 > a 2 − t and t > 0, then the eigenvalues of matrix D 0 , defined in (6), are equal to a 1 +t, a 1 +t, a 2 −t, a 2 −t and the orthogonal matrix that diagonalizes D 0 is equal to…”
Section: Theorem 31 ([9]mentioning
confidence: 99%
“…. , λ n } that can be the spectrum of a matrix A ∈ S(G), and is known as the Inverse eigenvalue problem for G. This question and the related question of characterizing all possible multiplicities of eigenvalues of matrices in S(G) have been studied primarily for trees [6,11,13,14]. A subproblem to the inverse eigenvalue problem for graphs that has attracted a lot of attention over the years is that of minimizing the rank of all A ∈ S(G).…”
Section: Introductionmentioning
confidence: 99%
“…, λ n } that can be the spectrum of a matrix A ∈ S(G) is known as the Inverse eigenvalue problem for G, and it is hard to answer in general. This question and the related question of characterizing all possible multiplicities of eigenvalues of matrices in S(G) has been studied primarily for trees [6,9,10,11]. The subproblem to the inverse eigenvalue problem for graphs that has attracted a lot of attention over the recent years is that is equivalent to finding the maximal multiplicity of an eigenvalue of A ∈ S(G).…”
Section: Introductionmentioning
confidence: 99%
“…In particular, we thank the reviewers for bringing the paper [5] on multiplicities of eigenvalues to our notice. We hope that this paper will be helpful in studying the multiplicities of eigenvalues for the family of dense centipedes.…”
Section: Acknowledgementmentioning
confidence: 99%