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

DOI10.1016/J.LAA.2016.09.014MaRDI QIDQ332633zbMATH OpenOpenAlexFDO

Authors Polona Oblak, Helena Šmigoc

Publication date 8 November 2016

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

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

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)

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.

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

Cites work

• Eigenvalues of nonnegative symmetric matrices
• Graphs that allow all the eigenvalue multiplicities to be even
• Graphs whose minimal rank is two
• Inertia sets for graphs on six or fewer vertices
• Minimum number of distinct eigenvalues of graphs
• On the possible multiplicities of the eigenvalues of a Hermitian matrix whose graph is a tree
• The graphs for which the maximum multiplicity of an eigenvalue is two
• The implicit construction of multiplicity lists for classes of trees and verification of some conjectures
• 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
• Unordered multiplicity lists of a class of binary trees
• Unordered multiplicity lists of wide double paths
• Zero forcing sets and the minimum rank of graphs

Cited in

(10)

• Achievable multiplicity partitions in the inverse eigenvalue problem of a graph
• scientific article; zbMATH DE number 2115849 (Why is no real title available?)
• The liberation set in the inverse eigenvalue problem of a graph
• Minimum rank and maximum eigenvalue multiplicity of symmetric tree sign patterns
• Corrigendum to: ``Achievable multiplicity partitions in the inverse eigenvalue problem of a graph
• Bordering of symmetric matrices and an application to the minimum number of distinct eigenvalues for the join of graphs
• Orthogonal symmetric matrices and joins of graphs
• Uniformly sparse graphs and matrices
• Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues 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)