The inverse eigenvalue problem of a graph: multiplicities and minors

DOI10.1016/J.JCTB.2019.10.005zbMATH Open1436.05059arXiv1708.00064OpenAlexW2983748611MaRDI QIDQ1985452FDOQ1985452

Yanyan Li

Publication date: 7 April 2020

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

Abstract: The inverse eigenvalue problem of a given graph $G$ is to determine all possible spectra of real symmetric matrices whose off-diagonal entries are governed by the adjacencies in $G$. Barrett et al. introduced the Strong Spectral Property (SSP) and the Strong Multiplicity Property (SMP) in [8]. In that paper it was shown that if a graph has a matrix with the SSP (or the SMP) then a supergraph has a matrix with the same spectrum (or ordered multiplicity list) augmented with simple eigenvalues if necessary, that is, subgraph monotonicity. In this paper we extend this to a form of minor monotonicity, with restrictions on where the new eigenvalues appear. These ideas are applied to solve the inverse eigenvalue problem for all graphs of order five, and to characterize forbidden minors of graphs having at most one multiple eigenvalue.

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

zbMATH Keywords

inverse eigenvalue problem[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Colin+de+Verdi%EF%BF%BD%EF%BF%BDre+type+parameter&go=Go Colin de Verdi��re type parameter]strong Arnold propertymaximum multiplicitydistinct eigenvaluesstrong multiplicity propertystrong spectral property

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (22)

• Spectral graph theory and the inverse eigenvalue problem of a graph
• On the inverse eigenvalue problem for block graphs
• Achievable multiplicity partitions in the inverse eigenvalue problem of a graph
• The strong spectral property of graphs: graph operations and barbell partitions
• Tight Frame Graphs Arising as Line Graphs
• The liberation set in the inverse eigenvalue problem of a graph
• Distinct eigenvalues are realizable with generic eigenvectors
• The bifurcation lemma for strong properties in the inverse eigenvalue problem of a graph
• The strong spectral property for graphs
• Diminimal families of arbitrary diameter
• Spectral arbitrariness for trees fails spectacularly
• The inverse nullity pair problem and the strong nullity interlacing property
• Sign patterns of orthogonal matrices and the strong inner product property
• Title not available (Why is that?)
• Ordered multiplicity inverse eigenvalue problem for graphs on six vertices
• Sparks of symmetric matrices and their graphs
• Corrigendum to: ``Achievable multiplicity partitions in the inverse eigenvalue problem of a graph
• Riemannian Newton-CG methods for constructing a positive doubly stochastic matrix from spectral data*
• Regular graphs of degree at most four that allow two distinct eigenvalues
• A geometric Gauss-Newton method for least squares inverse eigenvalue problems
• A zero forcing technique for bounding sums of eigenvalue multiplicities
• A Nordhaus-Gaddum conjecture for the minimum number of distinct eigenvalues of a graph

   Recommendations

• Title not available (Why is that?) 👍 👎
• The inverse eigenvalue and inertia problems for minimum rank two graphs 👍 👎
• Spectral graph theory and the inverse eigenvalue problem of a graph 👍 👎
• Spectral graph theory and the inverse eigenvalue problem of a graph 👍 👎
• Achievable multiplicity partitions in the inverse eigenvalue problem of a graph 👍 👎
• The combinatorial inverse eigenvalue problems: complete graphs and small graphs with strict inequality 👍 👎
• Title not available (Why is that?) 👍 👎
• On the inverse eigenvalue problem for block graphs 👍 👎
• The combinatorial inverse eigenvalue problem. II: All cases for small graphs 👍 👎
• Inverse eigenvalue problems on directed graphs 👍 👎

This page was built for publication: The inverse eigenvalue problem of a graph: multiplicities and minors

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