Sanprasert, Wannaporn
Loading...
1 results
Now showing 1 - 1 of 1
- Some of the metrics are blocked by yourconsent settings
Item type:Publication, A formula for the number of labelled trees in complete bipartite graph(2020-11-24) ;Portawin, Thipapat; In this paper, we use Prilfer's construction and exponential generating function to find the formula of the number of labelled tree with r<inf>1</inf>, r<inf>2</inf> end-vertices in complete bipartite graph K<inf>m,n</inf> denoted by L(m, n, r<inf>1</inf>, r<inf>2</inf>). For (equ).
