$k$-NIM trees: Characterization and Enumeration

Charles R. Johnson, George Tsoukalas, Greyson C. Wesley +1

Among those real symmetric matrices whose graph is a given tree $T$, the maximum multiplicity $M(T)$ that can be attained by an eigenvalue is known to be the path cover number of $…