Average mixing matrix of trees

From MaRDI portal



Abstract: We investigate the rank of the average mixing matrix of trees, with all eigenvalues distinct. The rank of the average mixing matrix of a tree on n vertices with n distinct eigenvalues is upper-bounded by fracn2. Computations on trees up to 20 vertices suggest that the rank attains this upper bound most of the times. We give an infinite family of trees whose average mixing matrices have ranks which are bounded away from this upper bound. We also give a lower bound on the rank of the average mixing matrix of a tree.






Describes a project that uses

Uses Software






This page was built for publication: Average mixing matrix of trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4568088)