Contents

Ars Combinatoria

  • Research article

Enumeration For No-Trivial Spanning Forests of Complete Bipartite Graphs

Bolian Liu1, Fengying Huang2
1School of Mathematical Sciences, South China Normal University, Guangzhou, 510631, P.R. China
2School of Computer Science, Guangdong Polytechnic Normal University, Guangzhou, 510631, P.R. China
  • Published: 31/10/2010

Abstract

In this paper, we give another proof for labeled spanning forests of the complete bipartite graph \(K_{m,n}\), and obtain two Abel-type polynomials. And then we investigate the enumeration of non-trivial rooted labeled spanning forests of the complete bipartite graph \(K_{m,n}\).

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Bolian Liu, Fengying Huang. Enumeration For No-Trivial Spanning Forests of Complete Bipartite Graphs[J], Ars Combinatoria, Volume 097. 289-300. .