Michael D. Hendy A combinatorial description of the closest tree algorithm for finding evolutionary trees. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1991, v:96, n:1, pp:51-58 [Journal]

Ferenc Juhász The asymptotic behaviour of Fiedler's algebraic connectivity for random graphs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1991, v:96, n:1, pp:59-63 [Journal]