On Directed Graph Solutions of Linear Algebraic Equations
Wai‐Kai Chen · SIAM Review · 1967
Previous article Next article On Directed Graph Solutions of Linear Algebraic EquationsWai-Kai ChenWai-Kai Chenhttps://doi.org/10.1137/1009110PDFBibTexSections ToolsAdd to favoritesExport CitationTrack CitationsEmail SectionsAbout[1] Dénes König, Über Graphen und ihre Anwendung auf Determinantentheorie und Mengenlehre, Math. Ann., 77 (1916), 453–465 MR1511872 CrossrefGoogle Scholar[2] R. Duncan Luce and , Albert D. Perry, A method of matrix analysis of group structure, Psychometrika, 14 (1949), 95–116 10.1007/BF02289146 MR0035974 CrossrefGoogle Scholar[3] I. C. Ross and , F. Harary, On the determination of redundancies in sociometric chains, Psychometrika, 17 (1952), 195–208 10.1007/BF02288782 0049.37803 CrossrefGoogle Scholar[4] M. Kac and , J. C. Ward, A combinatorial solution of the 2-dimensional Ising model, Phys. Rev., 88 (1952), 1332–1337 10.1103/PhysRev.88.1332 0048.45804 CrossrefISIGoogle Scholar[5] Franz E. Hohn and , L. Robert Schissler, Boolean matrices and the design of combinational relay switching circuits, Bell System Tech. J., 34 (1955), 177–202 MR0073453 CrossrefISIGoogle Scholar[6] Lothar Collatz and , Ulrich Sinogowitz, Spektren endlicher Grafen, Abh. Math. Sem. Univ. Hamburg, 21 (1957), 63–77 MR0087952 0077.36704 CrossrefGoogle Scholar[7] David Rosenblatt, On the graphs and asymptotic forms of finite Boolean relation matrices and stochastic matrices, Naval. Res. Logist. Quart., 4 (1957), 151–167 MR0090910 CrossrefGoogle Scholar[8] I. M. Copi, Matrix development of the calculus of relations, J. Symbolic Logic, 13 (1958), 193–203 Google Scholar[9] Ian C. Ross and , Frank Harary, A description of strengthening and weakening members of a group, Sociometry, 22 (1959), 139–147 MR0109790 CrossrefGoogle Scholar[10] Frank Harary, A graph theoretic method for the complete reduction of a matrix with a view toward finding its eigenvalues, J. Math. Phys., 38 (1959/1960), 104–111 MR0109793 0087.01701 CrossrefGoogle Scholar[11] Frank Harary, The determinant of the adjacency matrix of a graph, SIAM Rev., 4 (1962), 202–210 10.1137/1004057 MR0144330 0113.17406 LinkISIGoogle Scholar[12] Wai-kai Chen, The inversion of matrices by flow graphs, J. Soc. Indust. Appl. Math., 12 (1964), 676–685 10.1137/0112058 MR0171796 0137.32901 LinkISIGoogle Scholar[13] W. k. Chen, On signal-flow graphs, Proc. IEEE, 52 (1964), 967– CrossrefISIGoogle Scholar[14] W. K. Chen, Flow graphs: some properties and methods of simplification, IEEE Trans. Circuit Theory, CT-12 (1965), 128–130 CrossrefGoogle Scholar[15] S. J. Mason, Feedback theory—some properties of signal flow graphs, Proc. IRE, 41 (1953), 1144–1156 CrossrefISIGoogle Scholar[16] S. J. Mason, Feedback theory—further properties of signal flow graphs, Proc. IRE, 44 (1956), 920–926 CrossrefISIGoogle Scholar[17] C. L. Coates, Flow graph solutions of linear algebraic equations, IRE Trans. Circuit Theory, CT-6 (1959), 170–187 CrossrefGoogle Scholar[18] F. E. Hohn, , S. Seshu and , D. D. Aufenkamp, The theory of nets, IRE Trans. Electronic Computers, EC-6 (1957), 154–161 CrossrefGoogle Scholar[19] W. K. Chen, Boolean matrices and switching nets, Math. Mag., 39 (1966), 1–8 0171.27802 CrossrefGoogle Scholar[20] C. A. Desoer, The optimum formula for the gain of a flow graph or a simple derivation of Coates' formula, Proc. IRE, 48 (1960), 883–889 CrossrefISIGoogle Scholar[21] J. G. Truxal, Control System Synthesis, McGraw-Hill, New York, 1955 Google Scholar[22] D. Younger, A simple derivation of Mason's formula, Proc. IRE, 51 (1963), 1043–1044 CrossrefISIGoogle Scholar[23] Wai-kai Chen, On the modifications of flow graphs, J. Soc. Indust. Appl. Math., 13 (1965), 493–505 10.1137/0113031 MR0183584 0134.43505 LinkISIGoogle Scholar[24] Wai-kai Chen, On directed trees and directed k-trees of a digraph and their generation, SIAM J. Appl. Math., 14 (1966), 550–560 10.1137/0114048 MR0209064 0146.20302 LinkISIGoogle Scholar[25] M. M. Milić, Flow-graph evaluation of the characteristic polynomial of a matrix, IEEE Trans. Circuit Theory, CT-11 (1964), 423–424 CrossrefGoogle Scholar[26] W. K. Chen, Comment on “flow-graph evaluation of the characteristic polynomial of a matrix”, IEEE Trans. Circuit Theory, CT-12 (1965), 434–435 Google Scholar[27] J. Ponstein, Self-avoiding paths and the adjacency matrix of a graph, SIAM J. Appl. Math., 14 (1966), 600–609 10.1137/0114051 MR0200199 0146.45901 LinkISIGoogle Scholar[28] Wai-kai Chen, Generation of trees and k-treesProc. Third Annual Allerton Conf. on Circuit and System Theory, Univ. Illinois, Urbana, Ill., 1965, 889–899 MR0266676 Google Scholar[29] Frank Harary, Graphs and matrices, SIAM Rev., 9 (1967), 83–90 10.1137/1009003 MR0210615 0146.45803 LinkISIGoogle Scholar[30] Wai-kai Chen, On flow graph solutions of linear algebraic equations, SIAM J. Appl. Math., 15 (1967), 136–142 10.1137/0115010 MR0211592 0152.35304 LinkISIGoogle Scholar[31] Frank Harary, A graph theoretic approach to matrix inversion by partitioning, Numer. Math., 4 (1962), 128–135 10.1007/BF01386304 MR0139545 0109.09003 CrossrefGoogle Scholar[32] R. L. Norman, A matrix method for location of cycles of a directed graph, A.I.Ch.E.J., 11 (1965), 450–452 CrossrefISIGoogle Scholar Previous article Next article FiguresRelatedReferencesCited ByDetails Some determinant expansions and the matrix-tree theoremDiscrete Mathematics, Vol. 124, No. 1-3 | 1 Jan 1994 Cross Ref Inversion of sparse matrices by a method based on graph theoryComputers & Chemical Engineering, Vol. 11, No. 6 | 1 Jan 1987 Cross Ref IntroductionGraphs and Order | 1 Jan 1985 Cross Ref Polynomials associated with the characters of SU(n)Journal of Pure and Applied Algebra, Vol. 36 | 1 Jan 1985 Cross Ref Properties of structure generating functions of automata and their applications for linear systemsTheoretical Computer Science, Vol. 18, No. 2 | 1 May 1982 Cross Ref STRUCTURE AND STABILITY IN WEIGHTED DIGRAPH MODELSAnnals of the New York Academy of Sciences, Vol. 321, No. 1 Papers in Mat | 1 May 1979 Cross Ref A survey of sparse matrix researchProceedings of the IEEE, Vol. 65, No. 4 | 1 Apr 1977 Cross Ref ReferencesSparse Matrices | 1 Jan 1973 Cross Ref BibliographyApplied Graph Theory | 1 Jan 1971 Cross Ref On Monte Carlo algebraJournal of Applied Probability, Vol. 7, No. 02 | 14 July 2016 Cross Ref On Monte Carlo algebraJournal of Applied Probability, Vol. 7, No. 2 | 14 July 2016 Cross Ref On the nonsingular submatrices of the incidence matrix of a graph over the real fieldJournal of the Franklin Institute, Vol. 289, No. 2 | 1 Feb 1970 Cross Ref Topological analysis of a class of lumped vibrational systemsJournal of Sound and Vibration, Vol. 10, No. 2 | 1 Sep 1969 Cross Ref Volume 9, Issue 4| 1967SIAM Review627-777 History Submitted:08 September 1966Published online:18 July 2006 InformationCopyright © 1967 Society for Industrial and Applied MathematicsPDF Download Article & Publication DataArticle DOI:10.1137/1009110Article page range:pp. 692-707ISSN (print):0036-1445ISSN (online):1095-7200Publisher:Society for Industrial and Applied Mathematics