Abstract
In this paper, symbolic code matrix, constant matrix and count matrix are defined. The first two matrices are used to describe the elemental expression of augmented matrix and the node admittance equation is thus obtained. The third matrix is used to obtain the incoming degree matrix, and according to the matrix all the 1-factors of the Coates graph are given. By using the data code, the determinant is expanded and the same items in the expansion are merged. Thus the symbolic network function in which no term can-cellation occurs is generated.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
P. M. Lin, G. E. Alderson, SNAP A Computer Program for Generating Symbolic Network Function, School Elec. Eng., Purdue Univ., Lafaytte, Ind., Rep. TR-EE70-16, Aug. 1970.
W. K. Chen, Applied graph theory, North-Holland, 1976, P. 144.
P. R. A. ly. Applied Circuit Theory, Matrix and Computer Methods, Ellis Horwood Limited, 1980, Chap. 4.
Author information
Authors and Affiliations
Additional information
The Project Supported by National Natural Science Foundation of China
About this article
Cite this article
Xiqing, Y., Shengxun, L. Coates graph approach for generating symbolic network function. J. of Electron.(China) 6, 378–385 (1989). https://doi.org/10.1007/BF02778923
Issue Date:
DOI: https://doi.org/10.1007/BF02778923