The maximum of the minimal multiplicity of eigenvalues of symmetric matrices whose pattern is constrained by a graph
Spectral Theory
2016-06-17 v1
Abstract
In this paper we introduce a parameter , defined as the maximum over the minimal multiplicities of eigenvalues among all symmetric matrices corresponding to a graph . We compute for several families of graphs.
Keywords
Cite
@article{arxiv.1606.05214,
title = {The maximum of the minimal multiplicity of eigenvalues of symmetric matrices whose pattern is constrained by a graph},
author = {Polona Oblak and Helena Šmigoc},
journal= {arXiv preprint arXiv:1606.05214},
year = {2016}
}