Generalizations of the Strong Arnold Property and the Minimum Number of Distinct Eigenvalues of a Graph

[摘要] For a given graph $G$ and an associated class of real symmetric matrices whose diagonal entries are governed by the adjacencies in $G$, the collection of all possible spectra for such matrices is considered. Building on the pioneering work of Colin de Ver

[学科分类] 离散数学和组合数学

[关键词] Inverse Eigenvalue Problem;Strong Arnold Property;Strong Spectral Property;Strong Multiplicity Property;Colin de Verdière type parameter;Maximum multiplicity