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

preprint2016arXivOpen access

Abstract

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

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.