Please use this identifier to cite or link to this item: https://gnanaganga.inflibnet.ac.in:8443/jspui/handle/123456789/7606
Title: On the Enumeration of Spanning Trees of the Complete Multipartite Graph
Authors: Lane Clark
Issue Date: 2003
Publisher: Bulletin of the Institute of Combinatorics and Its Applications
Abstract: We give a formula for the polynomial PKn1.......nk (x1 , .. . , xn) T spanning tree of Kn 1 , . .,nk where Kn1 . . .nk is the complete multipartite graph on [n] . Among the consequences is a formula for the number of spanning trees of Kn1 .... nk with given degree sequence.
URI: http://gnanaganga.inflibnet.ac.in:8080/jspui/handle/123456789/7606
Appears in Collections:Articles to be qced

Files in This Item:
File SizeFormat 
On the Enumeration of Spanning Thees.pdf
  Restricted Access
2.1 MBAdobe PDFView/Open Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.