2 research outputs found

    A generalized enumeration of labeled trees and reverse Prüfer algorithm

    No full text
    A leader of a tree T on [n] is a vertex which has no smalle
    corecore