The maximum multiplicity of the largest \(k\)-th eigenvalue in a matrix whose graph is acyclic or unicyclic

DOI10.1016/j.disc.2019.06.030zbMath1417.05116OpenAlexW2954485064MaRDI QIDQ2317668

Mohammad Adm, Shaun M. Fallat

Publication date: 12 August 2019

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2019.06.030

zbMATH Keywords

treessymmetric matricesunicyclic graphmaximum nullitypartial inertia

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cites Work

• Unnamed Item
• Spectral multiplicity and splitting results for a class of qualitative matrices
• The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample
• On the minimum rank of the join of graphs and decomposable graphs
• The minimum rank of symmetric matrices described by a graph: a survey
• Smith normal form and acyclic matrices
• Construction of acyclic matrices from spectral data
• On the construction of a Jacobi matrix from mixed given data
• Inverse eigenvalue problems for Jacobi matrices
• Computation of minimal rank and path cover number for certain graphs
• Zero forcing sets and the minimum rank of graphs
• Minimum-rank matrices with prescribed graph
• Estimation of the maximum multiplicity of an eigenvalue in terms of the vertex degrees of the graph of a matrix
• On the minimum semidefinite rank of a simple graph
• Using variants of zero forcing to bound the inertia set of a graph
• On the Minimum Rank Among Positive Semidefinite Matrices with a Given Graph
• The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
• The Parter--Wiener Theorem: Refinement and Generalization
• On two conjectures regarding an inverse eigenvalue problem for acyclic symmetric matrices
• Spectral graph theory and the inverse eigenvalue problem of a graph
• On the Eigenvalues and Eigenvectors of a Class of Matrices

This page was built for publication: The maximum multiplicity of the largest \(k\)-th eigenvalue in a matrix whose graph is acyclic or unicyclic