On two conjectures regarding an inverse eigenvalue problem for acyclic symmetric matrices

DOI10.13001/1081-3810.1120zbMATH Open1055.15010OpenAlexW24921706WikidataQ122927792 ScholiaQ122927792MaRDI QIDQ4450710FDOQ4450710

Shaun M. Fallat, Francesco Barioli

Publication date: 15 February 2004

Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/124156

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Positive matrices and their generalizations; cones of matrices (15B48) Inverse problems in linear algebra (15A29)

Cited In (20)

• Diagonalizable matrices whose graph is a tree: the minimum number of distinct eigenvalues and the feasibility of eigenvalue assignments
• The inverse eigenvalue problem of a graph: multiplicities and minors
• Smith normal form and acyclic matrices
• Change in vertex status after removal of another vertex in the general setting
• The inverse eigenvalue problem for linear trees
• Diminimal families of arbitrary diameter
• Computation of minimal rank and path cover number for certain graphs
• Questions, conjectures, and data about multiplicity lists for trees
• Unordered multiplicity lists of a class of binary trees
• Ordered multiplicity lists for eigenvalues of symmetric matrices whose graph is a linear tree
• The minimum rank of symmetric matrices described by a graph: a survey
• Sparks of symmetric matrices and their graphs
• On multiplicities of eigenvalues of a spectral problem on a prolate tree
• Upper bound for the diameter of a tree in the quantum graph theory
• Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph
• On the minimum number of distinct eigenvalues in the problem for a tree formed by Stieltjes strings
• A zero forcing technique for bounding sums of eigenvalue multiplicities
• The maximum multiplicity of the largest \(k\)-th eigenvalue in a matrix whose graph is acyclic or unicyclic
• Rigid linkages and partial zero forcing
• Some inverse problems for acyclic matrices

This page was built for publication: On two conjectures regarding an inverse eigenvalue problem for acyclic symmetric matrices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4450710)