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

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 G  . We develop basic properties of Mm(G)Mm(G) and compute it for several families of graphs.