This paper presents a unified theory of augmented graph. Two basic theorems for a matrix are proved. By making use of graph augmentation, evaluation of the determinant and cofactors associated with a matrix is carried out in one single analysis which is referred to the J-operation, so that is of a set of linear algebraic equations. The augmented Coates graph and Mason graph are topologically simplified. Since the need for the formulas called D-operation is eliminated, the augmented graph serves as a theoretic basis, on which the existing network topology could be reduced greatly.
P. M. Lin, IEEE Trans. on CT, CT-20(1973), 732.[2]G. E. Alderson et. al.,ibid., CT-20(1973), 48.[3]胡宗煊等,山东大学学报(自然科学版),1984年第1期第35页.[4]胡宗煊等,电子科学学刊,6(1985), 180.[5]Ф.Р.Гантмахер著,柯召译,矩阵论(上卷),高等教育出版社,1955,第2章.[6]W. K. Chen, Applied Graph Theory, Amsterdam: North-Holland, 1976, Chs. 3-4.[7]Z. X. Hu(胡宗煊), Directed tree Solutions to Linear Network Systems Proc. of Int. Conf. on Computers, Systems and Signal Processing, Bangalore, India, 1984.
DownLoad: