Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph

zbMath1366.05065arXiv1511.06705MaRDI QIDQ2363102

Leslie Hogben, Wayne W. Barrett, H. Tracy Hall, Jephian C.-H. Lin, Bryan L. Shader, Shaun M. Fallat

Publication date: 13 July 2017

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

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

zbMATH Keywords

inverse eigenvalue problemColin 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) Hermitian, skew-Hermitian, and related matrices (15B57) Implicit function theorems; global Newton methods on manifolds (58C15)

Related Items (26)

An explicit upper bound on disparity for trees of a given diameter ⋮ On the minimum number of distinct eigenvalues of a threshold graph ⋮ The bifurcation lemma for strong properties in the inverse eigenvalue problem of a graph ⋮ Ordered multiplicity inverse eigenvalue problem for graphs on six vertices ⋮ Orthogonal symmetric matrices and joins of graphs ⋮ The strong spectral property for graphs ⋮ A structured inverse spectrum problem for infinite graphs ⋮ Bordering of symmetric matrices and an application to the minimum number of distinct eigenvalues for the join of graphs ⋮ Regular graphs of degree at most four that allow two distinct eigenvalues ⋮ The strong spectral property of graphs: graph operations and barbell partitions ⋮ The liberation set in the inverse eigenvalue problem of a graph ⋮ Sparsity of graphs that allow two distinct eigenvalues ⋮ Diminimal families of arbitrary diameter ⋮ The allow sequence of distinct eigenvalues for a sign pattern ⋮ Sparks of symmetric matrices and their graphs ⋮ A Nordhaus-Gaddum conjecture for the minimum number of distinct eigenvalues of a graph ⋮ 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 ⋮ The inverse eigenvalue problem of a graph: multiplicities and minors ⋮ Sign patterns of orthogonal matrices and the strong inner product property ⋮ Unnamed Item ⋮ Rigid linkages and partial zero forcing ⋮ Achievable multiplicity partitions in the inverse eigenvalue problem of a graph ⋮ On Orthogonal Matrices with Zero Diagonal ⋮ A theorem on the number of distinct eigenvalues

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Construction of matrices with a given graph and prescribed interlaced spectral data
• On the graph complement conjecture for minimum rank
• The implicit function theorem. History, theory, and applications
• Expected values of parameters associated with the minimum rank of a graph
• 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.
• Multiplicities of eigenvalues and tree-width of graphs
• A characterization of tridiagonal matrices
• Introduction to Smooth Manifolds
• Positive semidefinite maximum nullity and zero forcing number
• The Construction of Jacobi and Periodic Jacobi Matrices With Prescribed Spectra
• On two conjectures regarding an inverse eigenvalue problem for acyclic symmetric matrices
• Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph
• 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
• Minimum number of distinct eigenvalues of graphs

This page was built for publication: Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph