1 paper · 1 filter
Luiz Emilio Allem, Rodrigo Orsini Braga, Carlos Hoppen +3
Given a tree T, let q(T) be the minimum number of distinct eigenvalues in a symmetric matrix whose underlying graph is T. It is well known that q(T)≥d(T)+1, where $d(T)…