Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Generating the List of Spanning Trees in \( K_{s,t}\)

Thomas Porter1
1Department of Mathematics, Southern Illinois University, Carbondale. IL 62901-4408
  • Published: 31/08/2004

Abstract

The formula for the number of spanning trees in \( K_{t_1,\ldots,t_P} \) is well known. In this paper, we give an algorithm that generates the list of spanning trees in \( K_{s,t} \).

Information
Guidelines
CP Initiatives
Follow CP
Facebook Twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
Thomas Porter. Generating the List of Spanning Trees in \( K_{s,t}\)[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 050. 17-32. DOI: .