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.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

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:

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