Does anyone know references or previous work to the following three questions:

Consider the graph G_NNI of unrooted binary phylogenetic trees on leaf set {1,…,n} where two trees form an edge if they are one NNI apart. Similarly G_SPR (where trees are joined if they are one SPR apart). Both these graphs are regular (each tree has the same number of neighbors) so if you start anywhere then after a while you will be at each tree with (asymptotically) uniform probability  the question is what is the mixing time (time to be near uniform as a function of n) for this random walk? Note I’m not talking about data (or Bayesian methods) here  just a pure mixing time question regarding this discrete graph. Does anyone know a paper that studies this (I think I saw one once, but all my papers/notes got lost in the 2010/2011 earthquakes here!).

There are various notions of the centre of a tree  e.g. the “centroid” (explained very nicely in the recent Tanglegrams paper by Matsen/Billey/Kas/Konvalinka paper on ArXiv). However does anyone know any paper that discusses what we might call a ‘leafcentroid’. Given a tree T call a vertex v of T a leafcentroid if each of the components of Tv contains at most half of the leaves of T. If T has no vertices of degree 2 then (just like the centroid) a tree either has a unique leafcentroid or two adjacent leaf centroids. However even for this class ( trees without vertices of degree 2) the leafcentroid can be different from the centroid! Just wondering if anyone has seen this notion mentioned or studied before?

Anyone know an early (pre1960s) reference to the simple but fundamental result: A collection C of nonempty subsets of X (including X) forms a hierarchy (nested family) if and only if C is the set of clusters of a rooted Xtree? It may be implicit in Linneaus (or even Aristotle!) but some more explicitly mathematical statement would be good.
Any advice will help for a book (‘mathematical phylogeny’) that I’m now halfway through writing I might ask a few further questions over the coming month or two.