The maximum of the minimal multiplicity of eigenvalues of symmetric matrices whose pattern is constrained by a graph

DOI10.1016/J.LAA.2016.09.014zbMATH Open1348.05127arXiv1606.05214OpenAlexW2963397771MaRDI QIDQ332633FDOQ332633

Polona Oblak, Helena Šmigoc

Publication date: 8 November 2016

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

Abstract: In this paper we introduce a parameter $Mm(G)$, defined as the maximum over the minimal multiplicities of eigenvalues among all symmetric matrices corresponding to a graph $G$. We compute $Mm(G)$ for several families of graphs.

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

Recommendations

• The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
• Multiplicity lists for symmetric matrices whose graphs have few missing edges
• Estimation of the maximum multiplicity of an eigenvalue in terms of the vertex degrees of the graph of a matrix
• The graphs for which the maximum multiplicity of an eigenvalue is two
• On the maximum multiplicity of an eigenvalue in a matrix whose graph contains exactly one cycle

zbMATH Keywords

symmetric matrixminimal rankmultiplicity of an eigenvalue

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)

Cites Work

• Zero forcing sets and the minimum rank of graphs
• Eigenvalues of nonnegative symmetric matrices
• The inverse eigenvalue problem for nonnegative matrices
• Minimum number of distinct eigenvalues of graphs
• The graphs for which the maximum multiplicity of an eigenvalue is two
• 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
• Graphs that allow all the eigenvalue multiplicities to be even
• Inertia sets for graphs on six or fewer vertices
• Unordered multiplicity lists of a class of binary trees
• Graphs whose minimal rank is two
• Unordered multiplicity lists of wide double paths
• The inertia set of the join of graphs

Cited In (7)

• Achievable multiplicity partitions in the inverse eigenvalue problem of a graph
• Title not available (Why is that?)
• The liberation set in the inverse eigenvalue problem of a graph
• Minimum rank and maximum eigenvalue multiplicity of symmetric tree sign patterns
• Bordering of symmetric matrices and an application to the minimum number of distinct eigenvalues for the join of graphs
• Corrigendum to: ``Achievable multiplicity partitions in the inverse eigenvalue problem of a graph
• The maximum multiplicity of the largest \(k\)-th eigenvalue in a matrix whose graph is acyclic or unicyclic

This page was built for publication: The maximum of the minimal multiplicity of eigenvalues of symmetric matrices whose pattern is constrained by a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q332633)