Contents

Ars Combinatoria

  • Research article

Enumeration for Spanning Forests of Complete Bipartite Graphs

Yinglie Jin1, Chunlin Liu2
1The Key Laboratory of Pure Mathematics and Combinatorics, Ministry of Education, China
2Center for Combinatorics, Nankai University, Tianjin 300071, P.R. China
  • Published: 31/01/2004

Abstract

This paper discusses the enumeration of rooted labelled 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
Yinglie Jin, Chunlin Liu. Enumeration for Spanning Forests of Complete Bipartite Graphs[J], Ars Combinatoria, Volume 070. 135-138. .