DocumentCode
1171766
Title
General solution to the spanning tree enumeration problem in multigraph wheels
Author
Bose, N.K. ; Feick, R. ; Sun, F.K.
Volume
20
Issue
1
fYear
1973
fDate
1/1/1973 12:00:00 AM
Firstpage
69
Lastpage
70
Abstract
A recurrence relation and an explicit solution for the number of spanning trees in a multigraph wheel with unequal numbers of spokes and rim edges are given. Previous results can be identified as special cases of the general enumeration and the solution for one new specific case is included.
Keywords
Network topology; Trees; Wheels; Joining processes; Testing; Wheels;
fLanguage
English
Journal_Title
Circuit Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9324
Type
jour
DOI
10.1109/TCT.1973.1083621
Filename
1083621
Link To Document