ChanS. P.Introductory Topological Analysis of Electrical Networks. To be published by Holt, Rinehart & Winston (1968)
2.
SeshuS., and ReedM. B.Linear Graphs and Electrical Networks.Addison-Wesley (1961)
3.
MayedaW., and SeshuS.Topological Formulas for Network Functions, University of Illinois Bulletin. 55, No. 23 (Nov. 1957)
4.
PercivalR. H.Solution of passive electrical networks by means of mathematical trees.J. Inst. Elect. Engrs. (London). Vol. 100, Part III, pp. 143–150(May 1953)
5.
MayedaW.Digital determination of topological quantities and network functions, Int. Tech. Rept No. 6, Contract No. DA-11-022-ORD-1983, Elect. Engr. Research Lab., U. of Illinois (January 1957)
6.
MacWilliamsF. J.Topological network analysis as a computer program, IRE Trans. on Circuit Theory, CT-5, pp. 228–229, (Sept. 1958)
7.
MayedaW., and Van ValkenburgM. E.Network analysis and synthesis by digital computers, 1957WESOCN Convention Record, Part 2, pp. 137–144.
8.
MayedaW., and Van ValkenburgM. E.Analysis of nonreciprocal networks by digital computer.1958IRE National Convention Record, Part 2, pp. 70–75.
9.
MayedaW.Reducing Computer Time in the Analysis of Networks by Digital Computer, IRE Trans. on Circuit Theory.CT-6, No. 1 (March 1959)
10.
WatanadeH.A Computational method for network topology.IRE Trans. on Circuit Theory, CT-7, No. 3, pp. 296–302 (Sept. 1960)
11.
TalbotA.Topological formulas for active networks.Int. Tech. Rept No. 8, Contract No. DA-11-022-ORD-1983, Elect Engr., Research Lab., University of Illinois (Jan. 1958)
12.
MayedaW., and SeshuS.Generation of trees without duplications.IEEE Trans. on Circuit Theory, CT-12, No. 2, pp. 170–180 (June 1965)
13.
MayedaW.Topological formulas for active networks.Int. Tech. Report No. 8 Contract No. DA-11-022-ORD-1983, Elect Engr., Research Lab., University of Illinois (January 1958)
14.
ChenW. K.Topological analysis for active networks.IEEE Trans. on Circuit Theory, CT-12, No. 1 (March 1965)
15.
TalbotA.Topological analysis for active networks.IEEE Trans. on Circuit Theory, CT-13, No. 1, pp. 111–112 (March 1966)
16.
ChanS. P., and ChanS. G.Topological formulas for digital computation.Proc. 1st. Annual Princeton Conference on Information Sciences and Systems (March 1967)
17.
MintyG. J.A simple algorithm for listing all the trees of a graph.IEEE Trans. on Circuit Theory, CT-12, No. 1, p. 120 (March 1965)
18.
HakimiS. L.Recent progress and new problems in applied graph theory.1966IEEE Region Six Conference Record, 2, pp. 635–642 (April 1966)
19.
KuoF. F.Network analysis by digital computer.Proc. IEEE54, No. 6 pp. 820–829 (June 1966)