Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

General solution to the spanning tree enumeration problem in multigraph wheels

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
3 Author(s)

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.

Published in:

Circuit Theory, IEEE Transactions on  (Volume:20 ,  Issue: 1 )