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 Field | Value | Language |
---|---|---|
dc.contributor.author | Lane Clark | - |
dc.date.accessioned | 2024-02-27T06:20:30Z | - |
dc.date.available | 2024-02-27T06:20:30Z | - |
dc.date.issued | 2003 | - |
dc.identifier.uri | http://gnanaganga.inflibnet.ac.in:8080/jspui/handle/123456789/7606 | - |
dc.description.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. | - |
dc.publisher | Bulletin of the Institute of Combinatorics and Its Applications | - |
dc.title | On the Enumeration of Spanning Trees of the Complete Multipartite Graph | - |
dc.vol | Vol 38 | - |
Appears in Collections: | Articles to be qced |
Files in This Item:
File | Size | Format | |
---|---|---|---|
On the Enumeration of Spanning Thees.pdf Restricted Access | 2.1 MB | Adobe PDF | View/Open Request a copy |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.