Graphs that allow all the eigenvalue multiplicities to be even

DOI10.1016/j.laa.2014.04.017zbMath1288.05165arXiv1401.1940OpenAlexW2963519751MaRDI QIDQ2451699

Helena Šmigoc, Polona Oblak

Publication date: 4 June 2014

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

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

zbMATH Keywords

grapheigenvaluesymmetric matrixmaximum multiplicity

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Hermitian, skew-Hermitian, and related matrices (15B57)

Related Items (5)

The maximum of the minimal multiplicity of eigenvalues of symmetric matrices whose pattern is constrained by a graph ⋮ Orthogonal symmetric matrices and joins of graphs ⋮ Corrigendum to: ``Achievable multiplicity partitions in 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

Cites Work

• Unordered multiplicity lists of a class of binary trees
• The inertia set of the join of graphs
• The inverse eigenvalue problem for nonnegative matrices
• The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample
• The minimum rank of symmetric matrices described by a graph: a survey
• On the possible multiplicities of the eigenvalues of a Hermitian matrix whose graph is a tree
• The implicit construction of multiplicity lists for classes of trees and verification of some conjectures
• Inertia sets for graphs on six or fewer vertices
• Graphs whose minimal rank is two
• Unordered multiplicity lists of wide double paths
• Minimum number of distinct eigenvalues of graphs

This page was built for publication: Graphs that allow all the eigenvalue multiplicities to be even