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

2016/06/16 by Oblak, Polona, Šmigoc, Helena
#05C50 #15A18 #15B57 #FOS: Mathematics #Spectral Theory (math.SP)

paper · doi:10.48550/arxiv.1606.05214

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.

Related

• The maximum multiplicity of an eigenvalue of symmetric matrices with a given graph
• Minimum number of distinct eigenvalues of graphs
• Applications of analysis to the determination of the minimum number of distinct eigenvalues of a graph
• The inverse eigenvalue problem of a graph: Multiplicities and minors
• The Graphs for which the Maximum Multiplicity of an Eigenvalue is Two