DocumentCode :
1169809
Title :
Number of Spanning Trees in Multigraph Wheels
Author :
Bedrosian, Samuel D.
Volume :
19
Issue :
1
fYear :
1972
fDate :
1/1/1972 12:00:00 AM
Firstpage :
77
Lastpage :
78
Abstract :
Taking the graph called the wheel 
as the join of 
and 
, we consider it along with three multigraph variations. A recursion formula for the number of spanning trees in 
, and other pertinent formulas are presented. A related resistance network problem is also discussed briefly.
as the join of and , we consider it along with three multigraph variations. A recursion formula for the number of spanning trees in , and other pertinent formulas are presented. A related resistance network problem is also discussed briefly.Keywords :
Network topology; Trees; Wheels; Tree graphs; Wheels;
fLanguage :
English
Journal_Title :
Circuit Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9324
Type :
jour
DOI :
10.1109/TCT.1972.1083410
Filename :
1083410
Link To Document :
