Skip to main content Accessibility help
×
Hostname: page-component-76fb5796d-vfjqv Total loading time: 0 Render date: 2024-04-29T15:04:46.598Z Has data issue: true hasContentIssue false

Bibliography

Published online by Cambridge University Press:  09 February 2018

Charles R. Johnson
Affiliation:
College of William and Mary, Virginia
Carlos M. Saiago
Affiliation:
Universidade Nova de Lisboa, Portugal
Get access

Summary

Image of the first page of this content. For PDF version, please use the ‘Save PDF’ preceeding this image.'
Type
Chapter
Information
Publisher: Cambridge University Press
Print publication year: 2018

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

[BF04] F., Barioli and S.M., Fallat. On two conjectures regarding an inverse eigenvalue problem for acyclic symmetric matrices. Electronic Journal of Linear Algebra 11:41–50 (2004).
[BF05] F., Barioli and S.M., Fallat. On the eigenvalues of generalized and double generalized stars. Linear and Multilinear Algebra 53(4):269–291 (2005).
[BFHog04] F., Barioli, S.M., Fallat, and L., Hogben. Computation of minimal rank and path cover number for graphs. Linear Algebra and its Applications 392:289–303 (2004).
[BFHog05] F., Barioli, S.M., Fallat, and L., Hogben. On the difference between the maximum multiplicity and path cover number for tree-like graphs. Linear Algebra and its Applications 409:13–31 (2005).
[BFSm] F., Barioli, S.M., Fallat, and R.L., Smith. On acyclic and unicyclic graphs whose minimum rank equals the diameter. Linear Algebra and its Applications 429:1568–1578 (2008).
[BaHoL] W, Barrett, H. van der, Holst, and R., Loewy. Graphs whose minimal rank is two. Electronic Journal of Linear Algebra 11:258–280 (2004).
[BeL-D] A., Bento and A., Leal-Duarte. On Fidler's characterization of tridiagonal matrices over arbitrary fields. Linear Algebra and its Applications 401:467–481 (2005).
[BoG] D., Boley and G.H., Golub. A survey of inverse eigenvalue problems. Inverse Problems 3:595–622 (1987).
[BrLeSpi] A., Brandstadt, V.B., Le, and J.P., Spinrad. Graph Classes: A Survey. SIAM Monographs on Discrete Mathematics and Applications, SIAM, Philadelphia, 1999.
[BuCJLoS] S.P., Buckley, J.G., Corliss, C.R., Johnson, C.A., Lombardia, and C.M., Saiago. Questions, conjectures, and data about multiplicity lists for trees. Linear Algebra and its Applications, 511:72–109 (2016).
[Ca] D., Carlson. What are Schur complements, anyway? Linear Algebra and its Applications 74:257–275 (1986).
[ChaLes] C., Chartrand and L., Lesniak. Graphs ' Digraphs. Chapman ' Hall, London, 1996.
[CheGrJMc] Z., Chen, M., Grimm, C.R., Johnson, and P.R., McMichael. Undirected graphs of Hermitian matrices that admit only two distinct eigenvalues. Linear Algebra and its Applications 458:403–428 (2014).
[Chu] M.T., Chu. Inverse eigenvalue problems. SIAM Review 40:1–39 (1998).
[ChuG] M.T., Chu and G.H., Golub. Structured inverse eigenvalue problems. Acta Numerica 11:1–71 (2002).
[CvDSac] D., Cvetkovi'c, M., Doob, and H., Sachs. Spectra of Graphs. Johann Ambrosius Barth Verlag, 1995.
[CvRoSi] D., Cvetkovi'c, P., Rowlinson, and S., Simi'c. Eigenspaces of Graphs. Encyclopedia of Mathematics and Its Applications 66, Cambridge University Press, New York, 1997.
[FaPal] K., Fan and G., Pall. Imbedding conditions for Hermitian and normal matrices. Canadian Journal of Mathematics 9:298–304 (1957).
[FarJZ] M., Farber, C.R., Johnson, and L., Zhang. The number of interlacing equalities resulting from removal of a vertex from a tree. SIAM Journal on Discrete Mathematics 29(3):1245–1258 (2015).
[Fe] W., Ferguson. The construction of Jacobi and periodic Jacobi matrices with prescribed spectra. Mathematics of Computation 35:1203–1220 (1980).
[Fi] M., Fiedler. A characterization of tridiagonal matrices. Linear Algebra and Its Applications 2:191–197 (1969).
[FrMe] S., Friedland and A.A., Melkman. On the eigenvalues of non-negative Jacobi matrices. Linear Algebra and Its Applications 25:239–253 (1979).
[GeM] J., Genin and J., Maybee. Mechanical vibration trees. Journal of Mathematical Analysis and Applications 45:746–763 (1974).
[GraW] L.J., Gray and D.G., Wilson. Construction of a Jacobi matrix from spectral data. Linear Algebra and Its Applications 14:131–134 (1976).
[Ha] O.H., Hald. Inverse eigenvalue problems for Jacobi matrices. Linear Algebra and its Applications 14:63–85 (1976).
[HiJK] R.O., Hill, C.R., Johnson, and B.K., Kroschel. Extended interlacing intervals. Linear Algebra and its Applications 254:227–239 (1997).
[Hoc] H., Hochstadt. On the construction of a Jacobi matrix from spectral data. Linear Algebra and its Applications 18:435–446 (1974).
[HJ85] R., Horn and C.R., Johnson. Matrix Analysis. Cambridge University Press, New York, 1985.
[HJ91] R., Horn and C.R., Johnson. Topics in Matrix Analysis. Cambridge University Press, New York, 1991.
[HJ13] R., Horn and C.R., Johnson. Matrix Analysis. Cambridge University Press, New York, 2nd Edition, 2013.
[JHig] C.R., Johnson and V., Higgins. Inverse spectral problems for collections of leading principal submatrices of tridiagonal matrices, Linear Algebra and its Applications 489:104–122 (2016).
[JJ-SSh] C.R., Johnson, C., Jordan-Squire, and D.A., Sher. Eigenvalue assignments and the two largest multiplicities in a Hermitian matrix whose graph is a tree. Discrete Applied Mathematics 158(6):681–691 (2010).
[JK] C.R., Johnson and B.K., Kroschel. Principal submatrices, geometric multiplicities, and structured eigenvectors. SIAM Journal on Matrix Analysis and Applications 16(3):1004–1012 (1995).
[JKO] C.R., Johnson, B.K., Kroschel, and M., Omladic. Eigenvalue multiplicities in principal submatrices. Linear Algebra and its Applications 390:111–120 (2004).
[JL-D99] C.R., Johnson and A., Leal-Duarte. The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree. Linear and Multilinear Algebra 46:139–144 (1999).
[JL-D02b] C.R., Johnson and A., Leal-Duarte. On the possible multiplicities of the eigenvalues of an Hermitian matrix whose graph is a given tree. Linear Algebra and its Applications 348:7–21 (2002).
[JL-D04] C.R., Johnson and A., Leal-Duarte. Resolution of the symmetric nonnegative inverse eigenvalue problem for matrices subordinate to a bipartite graph. Positivity 8(2):209–213 (2004).
[JL-D06] C.R., Johnson and A., Leal-Duarte. Converse to the Parter-Wiener theorem: the case of non-trees. Discrete Mathematics 306(23):3125–3129 (2006).
[JL-DMc] C.R., Johnson, A., Leal-Duarte, and P.R., McMichael. Changes in vertex status and the fundamental decomposition of a tree relative to a multiple (Parter) eigenvalue. Discrete Applied Mathematics, to appear.
[JL-DS03a] C.R., Johnson, A., Leal-Duarte, and C.M., Saiago. The Parter-Wiener theorem: refinement and generalization. SIAM Journal on Matrix Analysis and Applications 25(2):352–361 (2003).
[JL-DS03b] C.R., Johnson, A., Leal-Duarte, and C.M., Saiago. 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 and its Applications 373:311–330 (2003).
[JL-DS07] C.R., Johnson, A., Leal-Duarte, and C.M., Saiago. Multiplicity lists for the eigenvalues of symmetric matrices with a given graph. In Handbook of Linear Algebra, ed. L., Hogben, chap. 34, Discrete Mathematics and its Applications, CRC Press, Boca Raton, FL, 2007.
[JL-DS08] C.R., Johnson, A., Leal-Duarte, and C.M., Saiago. The structure of matrices with a maximum multiplicity eigenvalue. Linear Algebra and its Applications 429(4):875–886 (2008).
[JL-DS12] C.R., Johnson, A., Leal-Duarte, and C.M., Saiago. The change in eigenvalue multiplicity associated with perturbation of a diagonal entry. Linear and Multilinear Algebra 60(5):525–532 (2012).
[JL-DS17] C.R., Johnson, A., Leal-Duarte, and C.M., Saiago. The number of distinct eigenvalues for which an index decreases multiplicity. Linear Algebra and its Applications 516(4):8–23 (2017).
[JL-DSSh] C.R., Johnson, A., Leal-Duarte, C.M., Saiago, and D. Sher. Eigenvalues, multiplicities and graphs. In Algebra and its Applications, D.V., Huynh, S.K., Jain, and S.R., Lopez-Permouth, eds., Contemporary Mathematics, AMS, 419:167–183 (2006).
[JL-DSSuWi] C.R., Johnson, A., Leal-Duarte, C.M., Saiago, B.D., Sutton, and A.J., Witt. On the relative position of multiple eigenvalues in the spectrum of an Hermitian matrix with a given graph. Linear Algebra and its Applications 363:147–159 (2003).
[JLetM-CSz] C.R., Johnson, J., Lettie, S., Mack-Crane, and A., Szabelska. Branch duplication in trees: Uniqueness of seed and enumeration of seeds, submitted.
[JLiWa] C.R., Johnson, A.A., Li, and A.J., Walker. Ordered multiplicity lists for eigenvalues of symmetric matrices whose graph is a linear tree. Discrete Mathematics 333:39–55 (2014).
[JLSmi] C.R., Johnson, R., Loewy, and P.A., Smith. The graphs for which the maximum multiplicity of an eigenvalue is two. Linear and Multilinear Algebra 57(7):713–736 (2009).
[JMc] C.R., Johnson and P.R., McMichael. The change in multiplicity of an eigenvalue of a Hermitian matrix associated with the removal of an edge from its graph. Discrete Mathematics 311(2–3):166–170 (2011).
[JNuSp] C.R., Johnson, J., Nuckols, and C., Spicer. The implicit construction of multiplicity lists for classes of trees and verification of some conjectures. Linear Algebra and its Applications 438(5):1990–2003 (2013).
[JS02] C.R., Johnson and C.M., Saiago. Estimation of the maximum multiplicity of an eigenvalue in terms of the vertex degrees of the graph of a matrix. Electronic Journal of Linear Algebra 9:27–31 (2002).
[JS06] C.R., Johnson and C.M., Saiago. The trees for which maximum multiplicity implies the simplicity of other eigenvalues. Discrete Mathematics 306(23):3130–3135 (2006).
[JS08] C.R., Johnson and C.M., Saiago. Branch duplication for the construction of multiple eigenvalues in an Hermitian matrix whose graph is a tree. Linear and Multilinear Algebra 56(4):357–380 (2008).
[JS16] C.R., Johnson and C.M., Saiago. Diameter minimal trees. Linear and Multilinear Algebra 64(3):557–571 (2016).
[JS17] C.R., Johnson and C.M., Saiago. Geometric Parter-Wiener, etc. theory. Linear Algebra and its Applications, to appear.
[JST17a] C.R., Johnson, C.M., Saiago, and K., Toyonaga. The change in multiplicity of an eigenvalue due to adding or removing edges, submitted.
[JST17b] C.R., Johnson, C.M., Saiago, and K., Toyonaga. Classification of vertices and edges with respect to the geometric multiplicity of an eigenvalue in a matrix, with a given graph, over a field, submitted.
[JSm] C.R., Johnson and R.L., Smith. Almost principal minors of inverse Mmatrices. Linear Algebra and its Applications 337:253–265 (2001).
[JSu] C.R., Johnson and B.D., Sutton. Hermitianmatrices, eigenvalue multiplicities, and eigenvector components. SIAM Journal on Matrix Analysis and Applications 26(2):390–399 (2004).
[JSuWi] C.R., Johnson, B.D., Sutton, and A., Witt. Implicit construction of multiple eigenvalues for trees. Linear and Multilinear Algebra 57(4):409–420 (2009).
[JT15] C.R., Johnson and K., Toyonaga. Application of an identity for subtrees with a given eigenvalue. Electronic Journal of Linear Algebra 30:964–973 (2015).
[JT17] C.R., Johnson and K., Toyonaga. The classification of edges and the change in multiplicity of an eigenvalue of a real symmmetric matrix resulting from the change in an edge value. Special Matrices 5:51–60 (2017).
[JZh] C.R., Johnson and Y., Zhang. Multiplicity lists for symmetric matrices whose graphs have many edges, submitted.
[KiSha08] I.-J., Kim and B.L., Shader. On Fiedler- and Parter-vertices of acyclic matrices. Linear Algebra and its Applications 428:2601–2613 (2008).
[KiSha09] I.-J, .Kim and B.L., Shader. Smith normal form and acyclic matrices. Journal of Algebraic Combinatorics 29(1):63–80 (2009).
[KiSha13] I.-J., Kim and B.L., Shader. Unordered multiplicity lists of a class of binary trees. Linear Algebra and its Applications 438:3781–3788 (2013).
[Lay] D.C., Lay. Linear Algebra and Its Applications. Addison-Wesley, 1994.
[L-D89] A., Leal-Duarte. Construction of acyclic matrices from spectral data. Linear Algebra and its Applications 113:173–182 (1989).
[L-D92] A., Leal-Duarte. Desigualdades Espectrais e Problemas de Existência em Teoria de Matrizes. Dissertacao de Doutoramento, Universidade de Coimbra, 1992.
[JL-D02a] A., Leal-Duarte and C.R., Johnson. On the minimum number of distinct eigenvalues for a symmetric matrix whose graph is a given tree. Mathematical Inequalities and Applications 5(2):175–180 (2002).
[MarOlk] A.W., Marshall and I., Olkin. Inequalities: Theory of Majorization and Its Application. Volume 143 in the Mathematics in Science and Engineering Series. Academic Press, Inc., New York, 1979.
[M] J.S., Maybee. Combinatorially symmetric matrices. Linear Algebra and its Applications 8:529–537 (1974).
[MOleVWie] J.S., Maybee, D.D., Olesky, P. Van Den, Driessche, and G., Wiener. Matrices, digraphs, and determinants. SIAM Journal on Matrix Analysis and Applications 10(4):500–519 (1989).
[Mc] P.R., McMichael. Multiplicity lists for classes of Hermitian matrices whose graph is a certain tree. Honors thesis, The College of William and Mary, under the Supervision of Charles R. Johnson, 2008.
[NaSha] R., Nair and B.L., Shader. Acyclic matrices with a small number of distinct eigenvalues. Linear Algebra and its Applications 438:4075–4089 (2013).
[NeSha15a] C., Nelson and B.L., Shader. All pairs suffice for a P-set. Linear Algebra and its Applications 475:114–118 (2015).
[NeSha15b] C., Nelson and B.L., Shader. Maximal P-sets of matrices whose graph is a tree. Linear Algebra and its Applications 485:485–502 (2015).
[Nu] Jonathan Edward, Nuckols. Trees and the implicit construction of eigenvalue multiplicity lists. Honors thesis, The College of William and Mary, under the Supervision of Charles R. Johnson, 2008.
[Ny] P., Nylen. Minimum-rank matrices with prescribed graph. Linear Algebra and its Applications 248:303–316 (1996).
[Oli] G.N., Oliveira. Matrices with prescribed characteristic polynomial and a prescribed submatrix I, II. Pacific Journal of Mathematics 29:653–667 (1969).
[P] S., Parter. On the eigenvalues and eigenvectors of a class of matrices. Journal of the Society for Industrial and Applied Mathematics 8:376–388 (1960).
[PY] S., Parter and J.W.T., Youngs. The symmetrization ofmatrices by diagonal matrices. Journal of Mathematical Analysis and Applications 4:102–110 (1962).
[Ru] W., Rudim. Principles of Mathematical Analysis. International Series in Pure and Applied Mathematics, 3rd Edition, McGraw-Hill Book Co., New York, 1976.
[Ry] H.J., Ryser. Combinatorial Mathematics. The Carus Mathematical Monographs, n. 14, M. A. A., 1963.
[S] C.M., Saiago. The Possible Multiplicities of the Eigenvalues of an Hermitian Matrix Whose Graph Is a Tree. Dissertacao de Doutoramento, Universidade Nova de Lisboa, 2003.
[Sh] D., Sher (Advisor: C.R., Johnson). Observations on the multiplicities of the eigenvalues of an Hermitian matrix with a tree graph. William and Mary, Research Experiences for Undergraduates program, summer 2004.
[TJU] K., Toyonaga, C.R., Johnson, and R., Uhrig. Multiplicities: Adding a vertex to a graph. In Applied and Computational Matrix Analysis, ed. N. Bebiano. MAT-TRIAD 2015. Springer Proceedings in Mathematics ' Statistics, Springer, Cham, 192:117–126 (2017).
[WalCo] J.A., Wald and C.J., Colbourn. Steiner trees, partial 2-trees, and minimum IFI networks. Networks 13:159–167 (1983).
[Wie] G., Wiener. Spectral multiplicity and splitting results for a class of qualitative matrices. Linear Algebra and its Applications 61:15–29 (1984).

Save book to Kindle

To save this book to your Kindle, first ensure coreplatform@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about saving to your Kindle.

Note you can select to save to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

Find out more about the Kindle Personal Document Service.

  • Bibliography
  • Charles R. Johnson, College of William and Mary, Virginia, Carlos M. Saiago, Universidade Nova de Lisboa, Portugal
  • Book: Eigenvalues, Multiplicities and Graphs
  • Online publication: 09 February 2018
  • Chapter DOI: https://doi.org/10.1017/9781316155158.017
Available formats
×

Save book to Dropbox

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Dropbox.

  • Bibliography
  • Charles R. Johnson, College of William and Mary, Virginia, Carlos M. Saiago, Universidade Nova de Lisboa, Portugal
  • Book: Eigenvalues, Multiplicities and Graphs
  • Online publication: 09 February 2018
  • Chapter DOI: https://doi.org/10.1017/9781316155158.017
Available formats
×

Save book to Google Drive

To save content items to your account, please confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account. Find out more about saving content to Google Drive.

  • Bibliography
  • Charles R. Johnson, College of William and Mary, Virginia, Carlos M. Saiago, Universidade Nova de Lisboa, Portugal
  • Book: Eigenvalues, Multiplicities and Graphs
  • Online publication: 09 February 2018
  • Chapter DOI: https://doi.org/10.1017/9781316155158.017
Available formats
×