A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
The rank of the average mixing matrix of trees with all eigenvalues distinct, is investigated. The rank of the average mixing matrix of a tree on n vertices with n distinct eigenvalues is bounded above by n /2 . Computations on trees up to 20 vertices suggest that the rank attains this upper bound most of the times. An infinite family of trees whose average mixing matrices have ranks which are bounded away from this upper bound, is given. A lower bound on the rank of the average mixing matrixdoi:10.13001/1081-3810.3746 fatcat:wheluqoxqrhmrgga2tvl6gf2y4