A zero forcing technique for bounding sums of eigenvalue multiplicities

DOI10.1016/j.laa.2021.07.014zbMath1471.05058arXiv2104.06213OpenAlexW3183182781MaRDI QIDQ1979365

Jephian C.-H. Lin, Franklin H. J. Kenter

Publication date: 2 September 2021

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

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

zbMATH Keywords

skew-symmetric matriceszero forcingpowers of graphsinverse eigenvalue problem for graphs (IEPG)ordered multiplicity sequences

Mathematics Subject Classification ID

Integer programming (90C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Inequalities involving eigenvalues and eigenvectors (15A42) Inverse problems in linear algebra (15A29) Games on graphs (graph-theoretic aspects) (05C57)

Related Items (1)

On the length of L-Grundy sequences

Uses Software

• Minimum Rank

Cites Work

• Unnamed Item
• Unnamed Item
• Upper bounds on the \(k\)-forcing number of a graph
• Minimum rank problems
• Minimum rank of skew-symmetric matrices described by a graph
• On minimum rank and zero forcing sets of a graph
• Techniques for determining the minimum rank of a small graph
• Zero forcing parameters and minimum rank problems
• The minimum rank of symmetric matrices described by a graph: a survey
• Smith normal form and acyclic matrices
• Families of graphs with maximum nullity equal to zero forcing number
• The inverse eigenvalue problem of a graph: multiplicities and minors
• Rigid linkages and partial zero forcing
• Zero forcing and maximum nullity for hypergraphs
• Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph
• Zero forcing for sign patterns
• Zero forcing sets and the minimum rank of graphs
• A characterization of tridiagonal matrices
• Maximum nullity and zero forcing of circulant graphs
• Odd Cycle Zero Forcing Parameters and the Minimum Rank of Graph Blowups
• A lower bound for the number of distinct eigenvalues of some real symmetric matrices
• Note on positive semidefinite maximum nullity and positive semidefinite zero forcing number of partial 2-trees
• On the minimum rank of not necessarily symmetric matrices: A preliminary study
• The inverse eigenvalue problem for Hermitian matrices whose graphs are cycles
• Using variants of zero forcing to bound the inertia set of a graph
• The Construction of Jacobi and Periodic Jacobi Matrices With Prescribed Spectra
• The Parter--Wiener Theorem: Refinement and Generalization
• On two conjectures regarding an inverse eigenvalue problem for acyclic symmetric matrices
• Domination in Graphs Applied to Electric Power Networks
• Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph
• Ordered multiplicity inverse eigenvalue problem for graphs on six vertices
• Applications of analysis to the determination of the minimum number of distinct eigenvalues of a graph
• Minimum number of distinct eigenvalues of graphs
• Spectral characterization of matchings in graphs

This page was built for publication: A zero forcing technique for bounding sums of eigenvalue multiplicities