A formula for the number of labelled trees in complete bipartite graph

Portawin, Thipapat; Samana, Decha; Sanprasert, Wannaporn

doi:10.1063/5.0026586

A formula for the number of labelled trees in complete bipartite graph

Author(s)

Portawin, Thipapat

Samana, Decha

Sanprasert, Wannaporn

Date Issued

November 24, 2020

Type

Conference Paper

DOI

10.1063/5.0026586

Abstract

In this paper, we use Prilfer's construction and exponential generating function to find the formula of the number of labelled tree with r1, r2 end-vertices in complete bipartite graph Km,n denoted by L(m, n, r1, r2). For (equ).

Citation

Aip Conference Proceedings, 2293, 2020