@article{LONGANI20082786,
    Abstract = {Let L(n,r) be the number of labelled trees with n points and r end-points. In this paper it is shown that the number L(n,r) can be obtained from the formula L(n,r)=nn−r∑i=0n−r−1(−1)in−ri(n−r−i)n−2.},
    Author = {Longani, Vites},
    File = {A formula for the number of labelled trees - 1-s2.0-S0898122108004604-main.pdf},
    ISSN = {0898-1221},
    Journal = {Computers \& Mathematics with Applications},
    Keywords = {Graph, Labelled, Trees, End-points, Counting},
    Number = {11},
    Pages = {2786-2788},
    Title = {A formula for the number of labelled trees},
    URL = {https://www.sciencedirect.com/science/article/pii/S0898122108004604},
    Volume = {56},
    Year = {2008},
    bdsk-url-1 = {https://www.sciencedirect.com/science/article/pii/S0898122108004604},
    bdsk-url-2 = {https://doi.org/10.1016/j.camwa.2008.07.011},
    date-added = {2022-12-22 22:09:40 +0100},
    date-modified = {2022-12-22 22:09:40 +0100},
    doi = {10.1016/j.camwa.2008.07.011}
}

@article{LONGANI20082786, Abstract = {Let L(n,r) be the number of labelled trees with n points and r end-points. In this paper it is shown that the number L(n,r) can be obtained from the formula L(n,r)=nn−r∑i=0n−r−1(−1)in−ri(n−r−i)n−2.}, Author = {Longani, Vites}, File = {A formula for the number of labelled trees - 1-s2.0-S0898122108004604-main.pdf}, ISSN = {0898-1221}, Journal = {Computers \& Mathematics with Applications}, Keywords = {Graph, Labelled, Trees, End-points, Counting}, Number = {11}, Pages = {2786-2788}, Title = {A formula for the number of labelled trees}, URL = {https://www.sciencedirect.com/science/article/pii/S0898122108004604}, Volume = {56}, Year = {2008}, bdsk-url-1 = {https://www.sciencedirect.com/science/article/pii/S0898122108004604}, bdsk-url-2 = {https://doi.org/10.1016/j.camwa.2008.07.011}, date-added = {2022-12-22 22:09:40 +0100}, date-modified = {2022-12-22 22:09:40 +0100}, doi = {10.1016/j.camwa.2008.07.011} }