1. IR @ Alliance University
  2. Journal Articles Archive
  3. Articles to be qced
Please use this identifier to cite or link to this item: https://gnanaganga.inflibnet.ac.in:8443/jspui/handle/123456789/7606
Full metadata record
DC FieldValueLanguage
dc.contributor.authorLane Clark-
dc.date.accessioned2024-02-27T06:20:30Z-
dc.date.available2024-02-27T06:20:30Z-
dc.date.issued2003-
dc.identifier.urihttp://gnanaganga.inflibnet.ac.in:8080/jspui/handle/123456789/7606-
dc.description.abstractWe 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.-
dc.publisherBulletin of the Institute of Combinatorics and Its Applications-
dc.titleOn the Enumeration of Spanning Trees of the Complete Multipartite Graph-
dc.volVol 38-
Appears in Collections:Articles to be qced

Files in This Item:
File SizeFormat 
On the Enumeration of Spanning Thees.pdf2.1 MBAdobe PDFView/Open
Show simple item record


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