Ordered multiplicity inverse eigenvalue problem for graphs on six vertices
From MaRDI portal
Publication:4989751
zbMath1464.05225arXiv1708.02438MaRDI QIDQ4989751
No author found.
Publication date: 26 May 2021
Full work available at URL: https://arxiv.org/abs/1708.02438
Related Items (14)
On the minimum number of distinct eigenvalues of a threshold graph ⋮ Orthogonal symmetric matrices and joins of graphs ⋮ The strong spectral property for 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 ⋮ Sparks of symmetric matrices and their graphs ⋮ A Nordhaus-Gaddum conjecture for the minimum number of distinct eigenvalues of a graph ⋮ A zero forcing technique for bounding sums of eigenvalue multiplicities ⋮ On the inverse eigenvalue problem for block graphs ⋮ Unnamed Item ⋮ Achievable multiplicity partitions in the inverse eigenvalue problem of a graph
Cites Work
- Unnamed Item
- Computing inertia sets using atoms
- The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample
- Zero forcing parameters and minimum rank problems
- The inverse eigenvalue problem of a graph: multiplicities and minors
- 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
- The inverse eigenvalue problem for Hermitian matrices whose graphs are cycles
- Spectral graph theory and the inverse eigenvalue problem of a graph
- Applications of analysis to the determination of the minimum number of distinct eigenvalues of a graph
- On the eigenvalues of generalized and double generalized stars
This page was built for publication: Ordered multiplicity inverse eigenvalue problem for graphs on six vertices