References
- Johnson CR, Leal-Duarte A, Saiago CM. Inverse eigenvalue problems and lists of multiplicities of eigenvalues for matrices whose graph is a tree: the case of generalized stars and double generalized stars. Linear Algebra Appl. 2003;373:311–330. doi: 10.1016/S0024-3795(03)00582-2
- Ferguson Jr WE. The construction of Jacobi and periodic Jacobi matrices with prescribed spectra. Math Comp. 1980;35(152):1203–1220. doi:10.1090/S0025-5718-1980-0583498-3.
- Fernandes R, da Fonseca CM. The inverse eigenvalue problem for Hermitian matrices whose graphs are cycles. Linear Multilinear Algebra. 2009;57(7):673–682. doi: 10.1080/03081080802187870
- Lin JC-H, Oblak P, Šmigoc H. On the inverse eigenvalue problem for block graphs. Linear Algebra Appl. 2021;631:379–397. doi: 10.1016/j.laa.2021.09.008
- Johnson CR, Wakhare T. The inverse eigenvalue problem for linear trees. Discrete Math. 2022;345(4):112737 doi: 10.1016/j.disc.2021.112737
- Barrett W, Butler S, Fallat SM, et al. The inverse eigenvalue problem of a graph: multiplicities and minors. J Combin Theory Ser B. 2020;142:276–306. doi: 10.1016/j.jctb.2019.10.005
- Ahn J, Alar C, Bjorkman B, et al. Ordered multiplicity inverse eigenvalue problem for graphs on six vertices. Electron J Linear Algebra. 2021;37:316–358. doi: 10.13001/ela.2021.5005
- Adm M, Fallat S, Meagher K, et al. Achievable multiplicity partitions in the inverse eigenvalue problem of a graph. Spec Matrices. 2019;7:276–290. doi: 10.1515/spma-2019-0022
- Monfared KH, Shader BL. The nowhere-zero eigenbasis problem for a graph. Linear Algebra Appl. 2016;505:296–312. doi: 10.1016/j.laa.2016.04.028
- Levene RH, Oblak P, Šmigoc H. Orthogonal symmetric matrices and joins of graphs. Linear Algebra Appl. 2022;652:213–238. doi: 10.1016/j.laa.2022.07.007
- Barrett W, Fallat S, Hall HT, et al. Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph. Electron J Combin. 2017;24(2):28 doi: 10.37236/5725 Paper 2.40.
- Leal-Duarte A, Johnson CR. On the minimum number of distinct eigenvalues for a symmetric matrix whose graph is a given tree. Math Inequal Appl. 2002;5(2):175–180. doi: 10.7153/mia-05-19
- Adm M, Fallat S, Meagher K, et al. Corrigendum to ‘Achievable multiplicity partitions in the inverse eigenvalue problem of a graph’ [Spec. Matrices 2019; 7:276–290.], Special Matrices; 2020; Vol. 8(1). pp. 235–241. doi: 10.1515/spma-2020-0117
- Ahmadi B, Alinaghipour F, Cavers MS, et al. Minimum number of distinct eigenvalues of graphs. Electron J Linear Algebra. 2013;26:673–691. doi: 10.13001/1081-3810.1679
- Bjorkman B, Hogben L, Ponce S, et al. Applications of analysis to the determination of the minimum number of distinct eigenvalues of a graph. Pure Appl Funct Anal. 2018;3(4):537–563.
- da Fonseca CM. A lower bound for the number of distinct eigenvalues of some real symmetric matrices. Electron J Linear Algebra. 2010;21:3–11. doi: 10.13001/1081-3810.1409
- Levene RH, Oblak P, Šmigoc H. A Nordhaus–Gaddum conjecture for the minimum number of distinct eigenvalues of a graph. Linear Algebra Appl. 2019;564:236–263. doi: 10.1016/j.laa.2018.12.001
- Fiedler M. A characterization of tridiagonal matrices. Linear Algebra Appl. 1969;2:191–197. doi: 10.1016/0024-3795(69)90027-5
- Laffey TJ, Šmigoc H. Spectra of principal submatrices of nonnegative matrices. Linear Algebra Appl. 2008;428(1):230–238. doi: 10.1016/j.laa.2007.06.029
- Šmigoc H. Construction of nonnegative matrices and the inverse eigenvalue problem. Linear Multilinear Algebra. 2005;53(2):85–96. doi: 10.1080/03081080500054281
- Horn RA, Johnson CR. Matrix analysis. 2nd ed., Cambridge: Cambridge University Press; 2013. doi: 10.1017/CBO9781139020411