We introduce the set GSSP of all simple graphs G with the property that each symmetric matrix corresponding to a graph G∈GSSP has the strong spectral property. We find several families of graphs in GSSP and, in particular, characterise the trees in GSSP.
@article{arxiv.1906.08690,
title = {The strong spectral property for graphs},
author = {Jephian C. -H. Lin and Polona Oblak and Helena Šmigoc},
journal= {arXiv preprint arXiv:1906.08690},
year = {2019}
}