Article ID Journal Published Year Pages File Type
4647746 Discrete Mathematics 2013 6 Pages PDF
Abstract
We find the asymptotic number of labelled spanning forests of the complete bipartite graph Km,n as m→∞ when m≤n and n=o(m6/5).
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
The asymptotic number of spanning forests of complete bipartite labelled graphs
Authors
,