DocumentCode
1166525
Title
Enumeration of spanning trees in certain graphs
Author
O´Neil, P.
Volume
17
Issue
2
fYear
1970
fDate
5/1/1970 12:00:00 AM
Firstpage
250
Lastpage
250
Abstract
This correspondence gives a formula for the number of trees spanning any graph formed from a complete graph by deleting branches forming disjoint K-partite subgraphs.
Keywords
Trees; Circuit theory; Educational institutions; Embedded computing; Graph theory; Integrated circuit layout; Integrated circuit technology; Joining processes; Moon; Tree graphs; Wiring;
fLanguage
English
Journal_Title
Circuit Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9324
Type
jour
DOI
10.1109/TCT.1970.1083075
Filename
1083075
Link To Document