Title :
Enumeration of spanning trees in certain graphs
fDate :
5/1/1970 12:00:00 AM
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;
Journal_Title :
Circuit Theory, IEEE Transactions on
DOI :
10.1109/TCT.1970.1083075
