By Charles Johnson and others

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 *T*. We say that a tree is *k*-NIM if, whenever an eigenvalue attains a multiplicity of *k-1* less... Show more

August 11, 2022

Loading full text...

Similar articles

Loading recommendations...

x1

$k$-NIM trees: Characterization and Enumeration

Click on play to start listening