The inverse eigenvalue problem of a graph: multiplicities and minors

DOI10.1016/j.jctb.2019.10.005zbMath1436.05059arXiv1708.00064OpenAlexW2983748611MaRDI QIDQ1985452

Yanyan Li

Publication date: 7 April 2020

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1708.00064

zbMATH Keywords

inverse eigenvalue problemdistinct eigenvaluesColin de Verdière type parameterstrong Arnold propertymaximum multiplicitystrong multiplicity propertystrong spectral property

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Inverse problems in linear algebra (15A29) Graph minors (05C83)

Related Items

The bifurcation lemma for strong properties in the inverse eigenvalue problem of a graph, Tight Frame Graphs Arising as Line Graphs, Ordered multiplicity inverse eigenvalue problem for graphs on six vertices, The strong spectral property for graphs, Regular graphs of degree at most four that allow two distinct eigenvalues, A geometric Gauss-Newton method for least squares inverse eigenvalue problems, The strong spectral property of graphs: graph operations and barbell partitions, The liberation set in the inverse eigenvalue problem of a graph, Diminimal families of arbitrary diameter, Sparks of symmetric matrices and their graphs, A Nordhaus-Gaddum conjecture for the minimum number of distinct eigenvalues of a graph, Riemannian Newton-CG methods for constructing a positive doubly stochastic matrix from spectral data*, Corrigendum to: ``Achievable multiplicity partitions in the inverse eigenvalue problem of a graph, A zero forcing technique for bounding sums of eigenvalue multiplicities, On the inverse eigenvalue problem for block graphs, Sign patterns of orthogonal matrices and the strong inner product property, Unnamed Item, Achievable multiplicity partitions in the inverse eigenvalue problem of a graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spectral (isotropic) manifolds and their dimension
• The implicit function theorem. History, theory, and applications
• Spectral multiplicity and splitting results for a class of qualitative matrices
• Minimum rank and maximum eigenvalue multiplicity of symmetric tree sign patterns
• Zero forcing parameters and minimum rank problems
• The minimum rank of symmetric matrices described by a graph: a survey
• 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.
• On the construction of a Jacobi matrix from spectral data
• Computation of minimal rank and path cover number for certain graphs
• Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph
• Zero forcing sets and the minimum rank of graphs
• On some inverse problems in matrix theory
• The Parter--Wiener Theorem: Refinement and Generalization
• On two conjectures regarding an inverse eigenvalue problem for acyclic symmetric matrices
• Implicit Functions and Solution Mappings
• A variant on the graph parameters of Colin de Verdiere: Implications to the minimum rank of graphs
• On the eigenvalues of generalized and double generalized stars
• On the Eigenvalues and Eigenvectors of a Class of Matrices
• Minimum number of distinct eigenvalues of graphs