DocumentCode :
1168451
Title :
Number of spanning trees in a wheel
Author :
Myers, B.
Volume :
18
Issue :
2
fYear :
1971
fDate :
3/1/1971 12:00:00 AM
Firstpage :
280
Lastpage :
282
Abstract :
A recurrence relation for the number of spanning trees 
in the wheel 
where 
, is obtained as 
where 
and where 
is the 
th number in the Lucas series 
where 
for 
. Alternately, 
where 
for 
odd and 
for even, thus confirming as a square number for odd and serving to verify a previous finding in 1969 by Sedlacek that 
.
in the wheel where , is obtained as where and where is the th number in the Lucas series where for . Alternately, where for odd and for even, thus confirming as a square number for odd and serving to verify a previous finding in 1969 by Sedlacek that .Keywords :
Network topology; Trees; Wheels; Bipartite graph; Circuit testing; Circuit theory; Contracts; Gold; Logistics; Moon; Transmission line matrix methods; Tree graphs; Wheels;
fLanguage :
English
Journal_Title :
Circuit Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9324
Type :
jour
DOI :
10.1109/TCT.1971.1083273
Filename :
1083273
Link To Document :
